Sciweavers

8746 search results - page 349 / 1750
» Diversifying search results
Sort
View
SAC
2005
ACM
16 years 11 days ago
A distributed content-based search engine based on mobile code
Current search engines crawl the Web, download content, and digest this content locally. For multimedia content, this involves considerable volumes of data. Furthermore, this proc...
Volker Roth, Ulrich Pinsdorf, Jan Peters
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
16 years 9 days ago
Smoothed Analysis of Binary Search Trees
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
Bodo Manthey, Rüdiger Reischuk
AMEC
2004
Springer
16 years 6 days ago
Agents' Strategies for the Dual Parallel Search in Partnership Formation Applications
In many two-sided search applications, autonomous agents can enjoy the advantage of parallel search, powered by their ability to handle an enormous amount of information, in a shor...
David Sarne, Sarit Kraus
ICTAI
2003
IEEE
16 years 2 days ago
Eliminating Redundancies in SAT Search Trees
Conflict analysis is a powerful paradigm of backtrack search algorithms, in particular for solving satisfiability problems arising from practical applications. Accordingly, most...
Richard Ostrowski, Bertrand Mazure, Lakhdar Sais, ...
CP
1998
Springer
15 years 11 months ago
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
We use a local search method we term Large Neighbourhood Search (LNS) for solving vehicle routing problems. LNS meshes well with constraint programming technology and is analogous...
Paul Shaw