Sciweavers

759 search results - page 92 / 152
» Optimal Graph Search with Iterated Graph Cuts
Sort
View
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
15 years 10 months ago
Approximating minimum bounded degree spanning trees to within one of optimal
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Mohit Singh, Lap Chi Lau
WWW
2003
ACM
15 years 10 months ago
Scaling personalized web search
Recent web search techniques augment traditional text matching with a global notion of "importance" based on the linkage structure of the web, such as in Google's P...
Glen Jeh, Jennifer Widom
GECCO
2010
Springer
180views Optimization» more  GECCO 2010»
15 years 2 months ago
Comparing results of 31 algorithms from the black-box optimization benchmarking BBOB-2009
This paper presents results of the BBOB-2009 benchmarking of 31 search algorithms on 24 noiseless functions in a black-box optimization scenario in continuous domain. The runtime ...
Nikolaus Hansen, Anne Auger, Raymond Ros, Steffen ...
COMPGEOM
2006
ACM
15 years 3 months ago
Colored intersection searching via sparse rectangular matrix multiplication
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
Haim Kaplan, Micha Sharir, Elad Verbin
CP
2007
Springer
15 years 4 months ago
AND/OR Multi-valued Decision Diagrams for Constraint Optimization
We propose a new top down search-based algorithm for compiling AND/OR Multi-Valued Decision Diagrams (AOMDDs), as representations of the optimal set of solutions for constraint opt...
Robert Mateescu, Radu Marinescu 0002, Rina Dechter