8413 search results - page 522 / 1683 » Ordering Problem Subgoals |
169
Voted
SAC
2004
ACM
16 years 9 days ago
2004
ACM
It is increasingly important to optimally select base stations in the design of cellular networks, as customers demand cheaper and better wireless services. From a set of potentia...
181
click to vote
AMAI
2004
Springer
16 years 8 days ago
2004
Springer
We study three new techniques which will speed up the branch-and-bound algorithm for the MAX-2-SAT problem: The first technique is a new lower bound function for the algorithm an...
220
Voted
ECAI
2004
Springer
16 years 8 days ago
2004
Springer
In this paper, we present a dynamic and adaptive variable ordering heuristic which guides systematic search toward inconsistent or hard parts of a Constraint Satisfaction Problem (...
176
Voted
TACAS
2004
Springer
16 years 6 days ago
2004
Springer
Abstract. The Succinct Solver Suite offers two analysis engines for solving data and control flow problems expressed in clausal form in a large fragment of first order logic. Th...
162
Voted
WEA
2004
Springer
16 years 6 days ago
2004
Springer
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...