We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
Web search engines respond to a query by returning more results than can be reasonably reviewed. These results typically include the title, link, and snippet of content from the t...
In the recent years, CSP's have come to be seen as the core problem in many applications. We propose here a hybrid algorithm (MC-FC) that combines two different search method...
Manydesign problems are solved using multiple levels of abstraction, wherea design at one level has combinatorially manychildren at the next level. A stochastic optimization metho...
Louis I. Steinberg, J. Storrs Hall, Brian D. Davis...
Comprehensive coverage of the public web is crucial to web search engines. Search engines use crawlers to retrieve pages and then discover new ones by extracting the pages' o...