Sciweavers

481 search results - page 55 / 97
» Martin's game: a lower bound for the number of sets
Sort
View
APPROX
2009
Springer
163views Algorithms» more  APPROX 2009»
14 years 3 months ago
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
José R. Correa, Martin Skutella, José...
CORR
2004
Springer
103views Education» more  CORR 2004»
13 years 8 months ago
The Freeze-Tag Problem: How to Wake Up a Swarm of Robots
An optimization problem that naturally arises in the study of swarm robotics is the Freeze-Tag Problem (FTP) of how to awaken a set of "asleep" robots, by having an awak...
Esther M. Arkin, Michael A. Bender, Sándor ...
ICTAC
2009
Springer
14 years 3 months ago
Input-Output Model Programs
Abstract. Model programs are used as high-level behavioral specifications typically representing abstract state machines. For modeling reactive systems, one uses input-output mode...
Margus Veanes, Nikolaj Bjørner
COCOON
2005
Springer
14 years 2 months ago
Oblivious and Adaptive Strategies for the Majority and Plurality Problems
In the well-studied Majority problem, we are given a set of n balls colored with two or more colors, and the goal is to use the minimum number of color comparisons to find a ball ...
Fan R. K. Chung, Ronald L. Graham, Jia Mao, Andrew...
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
14 years 2 months ago
On adequate performance measures for paging
Memory management is a fundamental problem in computer architecture and operating systems. We consider a two-level memory system with fast, but small cache and slow, but large mai...
Konstantinos Panagiotou, Alexander Souza