Sciweavers

34170 search results - page 6589 / 6834
» Optimization
Sort
View
SIROCCO
2008
15 years 5 months ago
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...
Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nic...
SIROCCO
2008
15 years 5 months ago
Locating and Repairing Faults in a Network with Mobile Agents
Abstract. We consider a fixed, undirected, known network and a number of "mobile agents" which can traverse the network in synchronized steps. Some nodes in the network m...
Colin Cooper, Ralf Klasing, Tomasz Radzik
NIPS
2007
15 years 5 months ago
A New View of Automatic Relevance Determination
Automatic relevance determination (ARD) and the closely-related sparse Bayesian learning (SBL) framework are effective tools for pruning large numbers of irrelevant features leadi...
David P. Wipf, Srikantan S. Nagarajan
125
Voted
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
15 years 5 months ago
Fast and reliable reconstruction of phylogenetic trees with very short edges
Abstract Ilan Gronau Shlomo Moran Sagi Snir Phylogenetic reconstruction is the problem of reconstructing an evolutionary tree from sequences corresponding to leaves of that tree. ...
Ilan Gronau, Shlomo Moran, Sagi Snir
156
Voted
SODA
2008
ACM
185views Algorithms» more  SODA 2008»
15 years 5 months ago
Better bounds for online load balancing on unrelated machines
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
Ioannis Caragiannis
« Prev « First page 6589 / 6834 Last » Next »