466 search results - page 5 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
JAIR
2011
14 years 4 months ago
2011
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a sea...
138
click to vote
CORR
1999
Springer
14 years 9 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
83
Voted
VLSID
2006
IEEE
15 years 3 months ago
2006
IEEE
Design space exploration is central to embedded system design. Typically this is a multi-objective search problem, where performance, power, area etc. are the different optimizati...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
88
Voted
ICMLA
2007
14 years 11 months ago
2007
We introduce a polynomial-time algorithm to learn Bayesian networks whose structure is restricted to nodes with in-degree at most k and to edges consistent with the optimal branch...