Sciweavers

9119 search results - page 417 / 1824
» A Simultaneous Search Problem
Sort
View
AAAI
1998
15 years 8 months ago
The Branching Factor of Regular Search Spaces
Manyproblems,such as the sliding-tile puzzles, generate searchtrees wheredifferent nodeshavedifferent numbersof children, in this case dependingon the position of the blank. Wesho...
Stefan Edelkamp, Richard E. Korf
ICGA
1993
75views Optimization» more  ICGA 1993»
15 years 8 months ago
Structure and Performance of Fine-Grain Parallelism in Genetic Search
Within the parallel genetic algorithm framework, there currently exists a growing dichotomy between coarse-pain and fine-grain parallel architectures. This paper attempts to chara...
Shumeet Baluja
CORR
2010
Springer
112views Education» more  CORR 2010»
15 years 7 months ago
Transdichotomous Results in Computational Geometry, II: Offline Search
We reexamine fundamental problems from computational geometry in the word RAM model, where input coordinates are integers that fit in a machine word. We develop a new algorithm fo...
Timothy M. Chan, Mihai Patrascu
SIGIR
2002
ACM
15 years 6 months ago
Effective collection metasearch in a hierarchical environment: global vs. localized retrieval performance
We compare standard global IR searching with user-centric localized techniques to address the database selection problem. We conduct a series of experiments to compare the retriev...
Jack G. Conrad, Changwen Yang, Joanne S. Claussen
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
16 years 7 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi