2109 search results - page 116 / 422 » Solving Necklace Constraint Problems |
134
click to vote
INFOCOM
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract— Robustness and reliability are critical issues in network management. To provide resiliency, a popular protection scheme against network failures is the simultaneous ro...
168
click to vote
CPAIOR
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either metho...
183
click to vote
AUSAI
2008
Springer
15 years 7 months ago
2008
Springer
Planning collision-free paths for multiple robots traversing a shared space is a problem that grows combinatorially with the number of robots. The naive centralised approach soon ...
160
click to vote
AIR
2004
15 years 4 months ago
2004
Ensuring truthfulness amongst self-interested agents bidding against one another in an auction can be computationally expensive when prices are determined using the Vickrey-Clarke-...
142
Voted
JAIR
2008
15 years 5 months ago
2008
In the efficient social choice problem, the goal is to assign values, subject to side constraints, to a set of variables to maximize the total utility across a population of agent...