151 search results - page 16 / 31 » A CSP Search Algorithm with Reduced Branching Factor |
CP
2008
Springer
13 years 9 months ago
2008
Springer
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
EUROSYS
2011
ACM
12 years 11 months ago
2011
ACM
We present an effective technique for crosschecking an IEEE 754 floating-point program and its SIMD-vectorized version, implemented in KLEE-FP, an extension to the KLEE symbolic ...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
Bayesian Networks are today used in various fields and domains due to their inherent ability to deal with uncertainty. Learning Bayesian Networks, however is an NP-Hard task [7]....
SODA
2004
ACM
13 years 9 months ago
2004
ACM
The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and...
ISCAS
2003
IEEE
14 years 28 days ago
2003
IEEE
This paper presents an Integrated Framework of Design Optimization and Space Minimization (IDOM) for generating the minimum number of functional units with schedule length and mem...