882 search results - page 59 / 177 » Local Search for Very Large SAT Problems |
113
click to vote
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
Decentralized MDPs provide powerful models of interactions in multi-agent environments, but are often very difficult or even computationally infeasible to solve optimally. Here we...
121
click to vote
PRICAI
1998
Springer
15 years 4 months ago
1998
Springer
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
86
Voted
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
103
click to vote
INFOCOM
2007
IEEE
15 years 6 months ago
2007
IEEE
A radio frequency identifier (RFID) system consists of inexpensive, uniquely identifiable tags that are mounted on physical objects, and readers that track these tags (and hence...
138
click to vote
ICML
1995
IEEE
16 years 19 days ago
1995
IEEE
In this paper we introduce Ant-Q, a family of algorithms which present many similarities with Q-learning (Watkins, 1989), and which we apply to the solution of symmetric and asymm...