131 search results - page 8 / 27 » Solution Enumeration for Projected Boolean Search Problems |
113
click to vote
AMAI
2000
Springer
15 years 3 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...
ILP
2000
Springer
15 years 3 months ago
2000
Springer
Induction of recursive theories in the normal ILP setting is a complex task because of the non-monotonicity of the consistency property. In this paper we propose computational solu...
HEURISTICS
2002
14 years 11 months ago
2002
This paper presents a heuristic algorithm for solving RCPSP/max, the resource constrained project scheduling problem with generalized precedence relations. The algorithm relies, a...
115
Voted
AIMSA
2010
Springer
14 years 6 months ago
2010
Springer
Abstract. The coalition structure generation problem represents an active research area in multi-agent systems. A coalition structure is defined as a partition of the agents involv...
AI
2002
Springer
14 years 11 months ago
2002
Springer
This article surveys three techniques for enhancing heuristic game-tree search pioneered in the author's Othello program Logistello, which dominated the computer Othello scen...