National Repository of Grey Literature 19,125 records found  beginprevious18955 - 18964nextend  jump to record: Search took 0.08 seconds. 
O složitosti dělení dortů
Sgall, Jiří ; Woeginger, G. J.
In the cake cutting problem, $n/ge2$ players want to cut a cake into $n$ pieces so that every player gets a ďfairď share of the cake by his own measure. One positive and one negative results are given.
KAM-DIMATIA Series 2004-685 and ITI Series 2004-206. Two algorithms for general list matrix partitions
Sgall, Jiří ; Feder, T. ; Hell, P. ; Králď, D.
List matrix partitions are restricted binary list constraint satisfaction problems which generalize list homomorphisms and many graph partition problems arising, e.g., in the study of perfect graphs. Most of the existing algorithms apply to concrete small matrices, i.e., to partitions problems, provide algorithms for their solution, and discuss their implications.
Zlepšený aproximační algoritmus pro asymetrický problém obchodního cestujícího
Blaser, M. ; Manthey, B. ; Sgall, Jiří
We consider the asymmetric traveling salesperson problem with /gamma-parameterized triangle inequality Chandran and Ram recently gave the first constant factor approximation algorithm with polynomial running time for this problem. We devise an approximation algorithm, which is better than the one of Chandran and Ram for /gamma in [0.5437,1).
Zlepšené online algoritmy pro správu bufferů v QoS hradlech
Chrobak, M. ; Jawor, W. ; Sgall, Jiří ; Tichý, Tomáš
We consider the following buffer management problem arising in QoS networks: packets with specified weights and deadlines arrive at a network switch and need to be forwarded so that the total value of forwarded packets is maximized. If packet is not forwarded before its deadline, it is lost and brings no profit. The main result of the paper is an online 1.939-competitive algorithm --.
Online rozvrhování úloh stejné délky
Chrobak, M. ; Jawor, W. ; Sgall, Jiří ; Tichý, Tomáš
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to determine a single-processor, non-preemptive schedule of these jobs that maximizes the number of completed jobs. In the online version, each job arrives at its release time.
Jednoduchý kombinatorický důkaz duality vícecestných toků a řezů
Bagchi, A. ; Chaudhary, A. ; Kolman, P. ; Sgall, Jiří
We present a simple combinatorial proof of the duality theorem for multiroute flows and cuts and its corollary which characterizes multiroute flows in termsof classical flows.
František Záviška. Inventory of personal papers
Haasová, M. ; Kábová, Hana
František Záviška (1879-1945)habilitated in theoretical physics at Charles University (Prague) in 1906, he was appointed professor extraordinarius in 1914 and professor ordinarius in 1919. He studied in the Cavendish laboratory in Cambridge (1906/7). He was physicist, primarily engaged in physical optics, theories of electromagnetic fields and hydrodynamics. He became member of the Royal Bohemian Learned Society (1919), the Czech Academy of Sciences and Arts (1914) and the Association of Czechoslovak Mathematicians and Physicists (1898). His personal papers are housed in 14 boxes. Biographical documents are rather rich as regards his study and university career, though correspondence, scientific work and documentation from his public activities are scarce. Set of testimonies of Záviška's death, obituaries, memories and articles to jubilees are an important part of the fonds. Documentation of his wife, Emilie Antonie, née Škodová, is preserved, too.

National Repository of Grey Literature : 19,125 records found   beginprevious18955 - 18964nextend  jump to record:
Interested in being notified about new results for this query?
Subscribe to the RSS feed.