Sciweavers

391 search results - page 1 / 79
» Comparison-Based Algorithms Are Robust and Randomized Algori...
Sort
View
EC
2007
167views ECommerce» more  EC 2007»
13 years 4 months ago
Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...
Sylvain Gelly, Sylvie Ruette, Olivier Teytaud
ESA
2005
Springer
161views Algorithms» more  ESA 2005»
13 years 10 months ago
Cache-Oblivious Comparison-Based Algorithms on Multisets
Abstract. We study three comparison-based problems related to multisets in the cache-oblivious model: Duplicate elimination, multisorting and finding the most frequent element (th...
Arash Farzan, Paolo Ferragina, Gianni Franceschini...
UAI
2004
13 years 6 months ago
A Complete Anytime Algorithm for Treewidth
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
Vibhav Gogate, Rina Dechter
IJCAI
2007
13 years 6 months ago
Fast Image Alignment Using Anytime Algorithms
Image alignment refers to finding the best transformation from a fixed reference image to a new image of a scene. This process is often guided by similarity measures between ima...
Rupert Brooks, Tal Arbel, Doina Precup
ATAL
2010
Springer
13 years 5 months ago
A distributed algorithm for anytime coalition structure generation
A major research challenge in multi-agent systems is the problem of partitioning a set of agents into mutually disjoint coalitions, such that the overall performance of the system...
Tomasz P. Michalak, Jacek Sroka, Talal Rahwan, Mic...