3495 search results - page 201 / 699 » On the random satisfiable process |
177
click to vote
CAV
2009
Springer
16 years 1 months ago
2009
Springer
The DPLL approach to the Boolean satisfiability problem (SAT) is a combination of search for a satisfying assignment and logical deduction, in which each process guides the other....
177
click to vote
CP
2008
Springer
15 years 9 months ago
2008
Springer
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
204
click to vote
EAAI
2006
15 years 7 months ago
2006
This paper presents a feasibility study of evolutionary scheduling for gas pipeline operations. The problem is complex because of several constraints that must be taken into consi...
197
click to vote
GAMEON
2009
15 years 4 months ago
2009
This article, assuming that player motivations are the outcome of continuous player-environment interactions, applies the needs framework of Murray (1938) to a computer game and i...
175
click to vote
TON
1998
15 years 6 months ago
1998
— This paper explores the variations in mean queue length for stationary arrival processes with the same mean and autocorrelation functions, or equivalently, the same mean and po...