13376 search results - page 465 / 2676 » Problem Solving with |
159
click to vote
AAAI
2008
15 years 7 months ago
2008
This paper investigates the impact of symbolic search for solving domain-independent action planning problems with binary decision diagrams (BDDs). Polynomial upper and exponential...
128
click to vote
TC
2008
15 years 5 months ago
2008
In this paper, the problem of finding good wordlength combinations for fixed-point digital signal processing flowgraphs is addressed. By formulating and solving an approximate opti...
195
click to vote
CPAIOR
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of pra...
138
click to vote
CP
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Branch-and-Check, introduced ten years ago, is a generalization of logic-based Benders decomposition. The key extension is to solve the Benders sub-problems at each feasi...
119
click to vote
JMMA
2002
15 years 4 months ago
2002
Abstract. Multiresolution representation of quadrilateral surface approximation (MRQSA) is a useful representation for progressive graphics transmission in networks. Based on two r...