6894 search results - page 23 / 1379 » Generation Problems |
150
click to vote
IPL
2000
15 years 5 months ago
2000
We examine the computational problem of generating all maximal models of a Boolean expression in CNF. We give a resolution-like method that reduces the unnegated variables of an e...
167
click to vote
AMAI
1999
Springer
15 years 5 months ago
1999
Springer
The paper focuses on evaluating constraint satisfaction search algorithms on application based random problem instances. The application we use is a well-studied problem in the el...
171
click to vote
CATA
2004
15 years 7 months ago
2004
We investigate a variant of the Fixed Charge Shortest Paths problem which enumerates the sequence of optimal solutions that arise as the focus shifts from the fixed cost parameter...
166
click to vote
INFORMATICALT
2000
15 years 5 months ago
2000
In this paper we present an algorithm for generating quadratic assignment problem (QAP) instances with known provably optimal solution. The flow matrix of such instances is constru...
167
click to vote
SCAI
2008
15 years 7 months ago
2008
The problem of automatically selecting simulation models for autonomous agents depending on their current intentions and beliefs is considered in this paper. The intended use of t...