693 search results - page 47 / 139 » Complexity Analysis of Heuristic CSP Search Algorithms |
129
click to vote
UAI
1996
15 years 5 months ago
1996
In learning belief networks, the single link lookahead search is widely adopted to reduce the search space. We show that there exists a class of probabilistic domain models which ...
133
click to vote
SIGIR
2010
ACM
15 years 7 months ago
2010
ACM
Entity information management (EIM) is a nascent IR research area that investigates the information management process about entities instead of documents. It is motivated by the ...
146
click to vote
ALGORITHMICA
2000
15 years 3 months ago
2000
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
145
click to vote
NICSO
2010
Springer
15 years 8 months ago
2010
Springer
t] Based on the mutation matrix formalism and past statistics of genetic algorithm, a Markov Chain transition probability matrix is introduced to provide a guided search for comple...
126
click to vote
COR
2008
15 years 4 months ago
2008
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...