Sciweavers

4565 search results - page 618 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
IFIP
2004
Springer
15 years 8 months ago
Solving Packing Problem with Weaker Block Solvers
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
Hu Zhang
FCT
2009
Springer
15 years 8 months ago
Multiway In-Place Merging
Abstract. We present an algorithm for asymptotically efficient multiway blockwise in-place merging. Given an array A containing sorted subsequences A1, . . . , Ak of respective le...
Viliam Geffert, Jozef Gajdos
NETWORKING
2004
15 years 4 months ago
Scalable Packet Classification through Maximum Entropy Hashing
In this paper we propose a new packet classification algorithm, which can substantially improve the performance of a classifier by decreasing the rulebase lookup latency. The algor...
Lynn Choi, Jaesung Heo, Hyogon Kim, Jinoo Joung, S...
ECRTS
2010
IEEE
15 years 3 months ago
Improved Tardiness Bounds for Global EDF
The Earliest Deadline First scheduling algorithm (EDF) is known to not be optimal under global scheduling on multiprocessor platforms. Results have been obtained that bound the ma...
Jeremy P. Erickson, UmaMaheswari Devi, Sanjoy K. B...
124
Voted
CORR
2006
Springer
93views Education» more  CORR 2006»
15 years 3 months ago
Multirobot rendezvous with visibility sensors in nonconvex environments
This paper presents a coordination algorithm for mobile autonomous robots. Relying upon distributed sensing, the robots achieve rendezvous, that is, they move to a common location....
Anurag Ganguli, Jorge Cortés, Francesco Bul...