113
Voted
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
Coordinating agents in a complex environment is a hard problem, but it can become even harder when certain characteristics of the tasks, like the required number of agents, are un...
141
Voted
COCO
2004
Springer
15 years 7 months ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
127
Voted
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
This paper reports on the development of a utility-based mechanism for managing sensing and communication in cooperative multi-sensor networks. The specific application considered...
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
142
Voted
COCO
2004
Springer
15 years 7 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...