466 search results - page 73 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
169
click to vote
JCB
2006
15 years 6 months ago
2006
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
187
click to vote
CONSTRAINTS
2010
15 years 6 months ago
2010
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
203
click to vote
DASFAA
2010
IEEE
15 years 10 months ago
2010
IEEE
This paper studies a new query on uncertain data, called k-selection query. Given an uncertain dataset of N objects, where each object is associated with a preference score and a p...
153
click to vote
ICIP
2007
IEEE
16 years 9 days ago
2007
IEEE
Block based motion compensation techniques make frequent use of Early Termination Algorithms (ETA) to reduce the computational cost of block matching process. ETAs have been well ...
170
click to vote
ISCA
2007
IEEE
16 years 6 days ago
2007
IEEE
Analytical modeling is applied to the automated design of application-specific superscalar processors. Using an analytical method bridges the gap between the size of the design sp...