Sciweavers

5580 search results - page 616 / 1116
» Randomized priority algorithms
Sort
View
CONSTRAINTS
2010
101views more  CONSTRAINTS 2010»
15 years 5 months ago
Evaluating the impact of AND/OR search on 0-1 integer linear programming
AND/OR search spaces accommodate advanced algorithmic schemes for graphical models which can exploit the structure of the model. We extend and evaluate the depth-first and best-fi...
Radu Marinescu 0002, Rina Dechter
DC
2008
15 years 5 months ago
The weakest failure detectors to boost obstruction-freedom
This paper determines necessary and sufficient conditions to implement wait-free and non-blocking contention managers in a shared memory system. The necessary conditions hold even...
Rachid Guerraoui, Michal Kapalka, Petr Kouznetsov
AUTOMATICA
2006
122views more  AUTOMATICA 2006»
15 years 5 months ago
Gibbs sampler-based coordination of autonomous swarms
In this paper a novel, Gibbs sampler-based algorithm is proposed for coordination of autonomous swarms. The swarm is modeled as a Markov random field (MRF) on a graph with a time-...
Wei Xi, Xiaobo Tan, John S. Baras
145
Voted
ECCC
2006
96views more  ECCC 2006»
15 years 4 months ago
When Does Greedy Learning of Relevant Features Succeed? --- A Fourier-based Characterization ---
Detecting the relevant attributes of an unknown target concept is an important and well studied problem in algorithmic learning. Simple greedy strategies have been proposed that s...
Jan Arpe, Rüdiger Reischuk
132
Voted
DAM
2007
74views more  DAM 2007»
15 years 4 months ago
On the uniform edge-partition of a tree
We study the problem of uniformly partitioning the edge set of a tree with n edges into k connected components, where k ≤ n. The objective is to minimize the ratio of the maximu...
Bang Ye Wu, Hung-Lung Wang, Shih Ta Kuan, Kun-Mao ...