Sgall, Jiří - Search Results - Digital Repository

guest :: login Digital Repository
		Search		Submit		Help		About

Home > Search Results: Sgall, Jiří

Search:

Search Tips :: Advanced Search

Search collections:

Sort by:	Display results:	Output format:

	Analysis of the Harmonic algorithm for three servers Chrobak, M. ; Sgall, Jiří Harmonic is a randomized $ k $-server algorithm that, at each step, given a request point $ r $, chooses the server to be moved to $ r $ with probability inversely proportional to the distance to $ r $. In this paper we prove that harmonic is $ 6 $-cotitive for $ k = 3 $. Detailed record
	Semi-online scheduling with decreasing job sizes Seiden, S. ; Sgall, Jiří ; Woeginger, G.W. Detailed record
	Approximation schemes for scheduling on uniformly related and identical parallel machines Epstein, L. ; Sgall, Jiří Detailed record
	O nemožnosti učení neuronů s impulsy Sgall, Jiří ; Šíma, J. The computational complexity of training a single spiking neuron N with adjustable synaptic delays and binary coded inputs and output is studied. A synchronization technique is introduced so that the results concerning the non-learnability of spiking neurons with binary delays are generalized to arbitrary delays. Detailed record
	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. Detailed record
	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. Detailed record
	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). Detailed record
	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 --. Detailed record
	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. Detailed record
	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. Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.

Digital Repository :: :: :: ::
Powered by v1.1.2
Maintained by

This site is also available in the following languages:
Česky English