840 search results - page 138 / 168 » Inapproximability of Combinatorial Optimization Problems |
ACMICEC
2007
ACM
14 years 3 months ago
2007
ACM
This paper presents a decentralized task allocation method that can handle allocation of tasks with time and precedence constraints in a multi-agent setting where not all informat...
GECCO
2006
Springer
14 years 2 months ago
2006
Springer
The behavior of natural, biological ecosystems is for a large part determined by environmental conditions. It should therefore be possible to experimentally manipulate such condit...
MICCAI
2007
Springer
14 years 12 months ago
2007
Springer
Non-rigid image registration is an ill-posed yet challenging problem due to its supernormal high degree of freedoms and inherent requirement of smoothness. Graph-cuts method is a p...
STACS
2007
Springer
14 years 5 months ago
2007
Springer
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
PVM
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. To practically solve NP-hard combinatorial optimization problems, local search algorithms and their parallel implementations on PVM or MPI have been frequently discussed....