3016 search results - page 324 / 604 » A Granular Approach to Web Search Result Presentation |
200
click to vote
AIPS
2006
15 years 8 months ago
2006
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
190
click to vote
ESWA
2007
15 years 6 months ago
2007
The goal of assembly planning consists in generating feasible sequences to assemble a product and selecting an efficient assembly sequence from which related constraint factors su...
192
click to vote
CIKM
2007
Springer
16 years 28 days ago
2007
Springer
Web search engines consistently collect information about users interaction with the system: they record the query they issued, the URL of presented and selected documents along w...
191
click to vote
ICST
2009
IEEE
16 years 1 months ago
2009
IEEE
Constraint solving lies at the heart of several specification-based approaches to automated testing. Korat is a previously developed algorithm for solving constraints in Java pro...
214
click to vote
BIBE
2008
IEEE
16 years 1 months ago
2008
IEEE
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...