1480 search results - page 195 / 296 » Ants can solve constraint satisfaction problems |
192
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
In this paper we study the constrained consensus problem, i.e. the problem of reaching a common point from the estimates generated by multiple agents that are constrained to lie in...
199
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
184
click to vote
DCOSS
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. We propose a distributed coalition formation strategy for collaborative sensing tasks in camera sensor networks. The proposed model supports taskdependent node selection ...
174
click to vote
NETWORKING
2007
15 years 8 months ago
2007
This paper addresses the optimal rate allocation problem in overlay content distribution for efficient utilization of limited bandwidths. We systematically present a series of opti...
220
click to vote
EPIA
1999
Springer
15 years 10 months ago
1999
Springer
OPL is a modeling language for mathematical programming and combinatorial optimization problems. It is the first modeling language to combine high-level algebraic and set notation...