110 search results - page 9 / 22 » A Faster Algorithm for Quasi-convex Integer Polynomial Optim... |
ASPDAC
2004
ACM
15 years 3 months ago
2004
ACM
As gate delays decrease faster than wire delays for each technology generation, buffer insertion becomes a popular method to reduce the interconnect delay. Several modern buffer in...
ICRA
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract— We study multi-robot routing problems (MRLDR) where a team of robots has to visit a set of given targets with linear decreasing rewards over time, such as required for ...
CSCLP
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Many agent coordination problems can be modeled as distributed constraint optimization problems (DCOPs). ADOPT is an asynchronous and distributed search algorithm that is...
ATAL
2003
Springer
15 years 3 months ago
2003
Springer
Optimal behavior is a very desirable property of autonomous agents and, as such, has received much attention over the years. However, making optimal decisions and executing optima...
MST
2010
14 years 8 months ago
2010
We study the following variant of the bin covering problem. We are given a set of unit sized items, where each item has a color associated with it. We are given an integer paramet...