110 search results - page 4 / 22 » GRASP - a new search algorithm for satisfiability |
AMAI
2000
Springer
13 years 9 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...
GLOBECOM
2008
IEEE
14 years 6 days ago
2008
IEEE
—In this paper, we address the problem of establishing full connectivity and satisfying required traffic capacity between disconnected clusters in large wireless ad-hoc ground n...
IJCAI
2001
13 years 7 months ago
2001
We describe two market-inspired approaches to propositional satisfiability. Whereas a previous market-inspired approach exhibited extremely slow performance, we find that variatio...
AIPS
2006
13 years 7 months ago
2006
Planning as satisfiability (SAT-Plan) is one of the best approaches to optimal planning, which has been shown effective on problems in many different domains. However, the potenti...
MP
2006
13 years 5 months ago
2006
There are many applications related to singly linearly constrained quadratic programs subjected to upper and lower bounds. In this paper, a new algorithm based on secant approximat...