216 search results - page 32 / 44 » Covering Problems with Hard Capacities |
IPPS
2008
IEEE
14 years 1 months ago
2008
IEEE
The creation of a virtual world environment (VWE) has significant costs, such as maintenance of server rooms, server administration, and customer service. The initial development...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
The processing power and memory capacity of independent and heterogeneous parallel machines can be combined to form a single parallel system that is more powerful than any of its ...
AAAI
2010
13 years 9 months ago
2010
In this paper, we present an integrated planning and robotic architecture that actively directs an agent engaged in an urban search and rescue (USAR) scenario. We describe three s...
ICC
2009
IEEE
13 years 5 months ago
2009
IEEE
During the last decade, many works were devoted to improving the performance of relaying techniques in ad hoc networks. One promising approach consists in allowing the relay nodes ...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...