367 search results - page 3 / 74 » Truncated incremental search |
INFOSCALE
2007
ACM
13 years 7 months ago
2007
ACM
Searching for non-text data (e.g., images) is mostly done by means of metadata annotations or by extracting the text close to the data. However, supporting real content-based audi...
AAAI
2000
13 years 7 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
AAAI
2012
11 years 8 months ago
2012
This paper concerns learning and prediction with probabilistic models where the domain sizes of latent variables have no a priori upper-bound. Current approaches represent prior d...
EKAW
2004
Springer
13 years 11 months ago
2004
Springer
A new incremental knowledge acquisition approach for the effective development of efficient problem solvers for combinatorial problems based on probabilistic search algorithms is ...
CONSTRAINTS
2007
13 years 5 months ago
2007
When a new (global) constraint is introduced in local search, measures for the penalty and variable conflicts of that constraint must be defined, and incremental algorithms for m...