3415 search results - page 256 / 683 » Lower bounds on kernelization |
154
click to vote
SIROCCO
2007
15 years 8 months ago
2007
Abstract. A large group of autonomous, mobile entities e.g. robots initially placed at some arbitrary node of the graph has to jointly visit all nodes (not necessarily all edges) a...
165
click to vote
JPDC
2008
15 years 6 months ago
2008
This research investigates the problem of robust static resource allocation for distributed computing systems operating under imposed Quality of Service (QoS) constraints. Often, ...
162
click to vote
JGT
2007
15 years 6 months ago
2007
A well-known theorem of Mader [5] states that highly connected subgraphs can be forced in finite graphs by assuming a high minimum degree. Solving a problem of Diestel [2], we ex...
183
click to vote
SIAMCOMP
2002
15 years 6 months ago
2002
This paper introduces a simple notion of layering as a tool for analyzing well-behaved runs of a given model of distributed computation. Using layering, a model-independent analysi...
180
click to vote
MASS
2010
15 years 4 months ago
2010
We study a problem in which a single sensor is scheduled to observe sites periodically, motivated by applications in which the goal is to maintain up-to-date readings for all the o...