4198 search results - page 94 / 840 » In search of lost time |
157
click to vote
IJCAI
1993
15 years 7 months ago
1993
One method for reducing the time required for plan generation is to learn search control rules from experience. Most of the recent work in learning search control knowledge has co...
145
click to vote
Publication
Usually, binary search only makes sense in sorted arrays. We show that insertion sort based on repeated "binary searches" in an initially unsorted array also sorts n ele...
152
click to vote
ICDM
2008
IEEE
16 years 13 days ago
2008
IEEE
We present a demo of ESTER, a search engine that combines the ease of use, speed and scalability of full-text search with the powerful semantic capabilities of ontologies. ESTER s...
128
click to vote
ICRA
2007
IEEE
16 years 9 days ago
2007
IEEE
— We present a sampling-based path planning and replanning algorithm that produces anytime solutions. Our algorithm tunes the quality of its result based on available search time...
143
click to vote
BIRD
2008
Springer
15 years 8 months ago
2008
Springer
We study the problem of structured motif search in DNA sequences. This is a fundamental task in bioinformatics which contributes to better understanding of genome characteristics a...