5263 search results - page 94 / 1053 » Open Constraint Optimization |
103
Voted
CP
2005
Springer
15 years 9 months ago
2005
Springer
Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real...
154
click to vote
CP
2008
Springer
15 years 5 months ago
2008
Springer
Modern computer architectures have complex features that can only be fully taken advantage of if the compiler schedules the compiled code. A standard region of code for scheduling ...
138
click to vote
ICRA
2005
IEEE
15 years 9 months ago
2005
IEEE
— We explore the control synthesis problem for a robot dynamically manipulating an object in the presence of multiple frictional contacts. Contacts occur both between the object ...
140
Voted
GLOBECOM
2006
IEEE
15 years 9 months ago
2006
IEEE
— This paper addresses learning based adaptive resource allocation for wireless MIMO channels with Markovian fading. The problem is posed as Constrained Markov Decision Process w...
148
click to vote
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract— We study the problem of maximizing the aggregated revenue in sensor networks with deadline constraints. Our model is that of a sensor network that is arranged in the fo...