1844 search results - page 81 / 369 » Exploiting the Structure of Distributed Constraint Optimizat... |
ML
2002
ACM
14 years 11 months ago
2002
ACM
Reinforcement learning policies face the exploration versus exploitation dilemma, i.e. the search for a balance between exploring the environment to find profitable actions while t...
ADHOCNOW
2005
Springer
15 years 4 months ago
2005
Springer
— In this paper, we address an optimization problem that arises in context of cache placement in sensor networks. In particular, we consider the cache placement problem where the...
JDA
2007
14 years 11 months ago
2007
In this paper, we address an optimization problem that arises in the context of cache placement in sensor networks. In particular, we consider the cache placement problem where th...
IJCAI
2001
15 years 21 days ago
2001
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
100
click to vote
EOR
2008
14 years 11 months ago
2008
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...