2343 search results - page 374 / 469 » Visual-Concept Search Solved |
167
Voted
ERCIMDL
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Today, bibliographic digital libraries play an important role in helping members of academic community search for novel research. In particular, author disambiguation for...
200
Voted
EWCBR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Case-based planning (CBP) is based on reusing past successful plans for solving new problems. CBP is particularly useful in environments where the large amount of time re...
139
click to vote
ALENEX
2007
15 years 6 months ago
2007
We present a novel randomized approach to the graph isomorphism problem. Our algorithm aims at solving difficult instances by producing randomized certificates for non-isomorphis...
140
Voted
CATS
2008
15 years 6 months ago
2008
Lazy clause generation is a hybrid SAT and finite domain propagation solver that tries to combine the advantages of both: succinct modelling using finite domains and powerful nogo...
147
click to vote
CSC
2008
15 years 6 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...