66 search results - page 8 / 14 » Easy distributions for combinatorial optimization problems w... |
ATAL
2009
Springer
14 years 1 months ago
2009
Springer
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...
ICSR
2000
Springer
13 years 10 months ago
2000
Springer
A serious problem of most transformation-based generators is that they are trying to achieve three mutually antagonistic goals simultaneously: 1) deeply factored operators and oper...
STOC
2006
ACM
14 years 7 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
ICPP
2002
IEEE
13 years 12 months ago
2002
IEEE
A cost-effective approach to building up scalable Videoon-Demand (VoD) servers is to couple a number of VoD servers together in a cluster. In this article, we study a crucial vide...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
The coordination of emergency responders and robots to undertake a number of tasks in disaster scenarios is a grand challenge for multi-agent systems. Central to this endeavour is...