2725 search results - page 129 / 545 » Constraint Solving for Interpolation |
138
click to vote
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
We extend the framework of mixed multi-unit combinatorial auctions to include time constraints, present an expressive bidding language, and show how to solve the winner determinati...
126
click to vote
CSUR
2000
15 years 3 months ago
2000
: Constraint satisfaction programming (CSP) is a powerful paradigm for solving complex combinatorial problems, which has gained a lot of attention recently. Putting the power of co...
127
click to vote
ICRA
2009
IEEE
15 years 10 months ago
2009
IEEE
— Rapidly-exploring Random Trees (RRTs) are widely used to solve large planning problems where the scope prohibits the feasibility of deterministic solvers, but the efficiency o...
130
click to vote
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—We investigate optimal resource allocation for delaylimited cooperative communication in time varying wireless networks. Motivated by real-time applications that have st...
144
click to vote
IROS
2008
IEEE
15 years 10 months ago
2008
IEEE
— We present a probabilistic architecture for solving generically the problem of extracting the task constraints through a Programming by Demonstration (PbD) framework and for ge...