Sciweavers

44 search results - page 5 / 9
» A Complete Anytime Algorithm for Number Partitioning
Sort
View
JCP
2007
149views more  JCP 2007»
13 years 7 months ago
Partitional Clustering Techniques for Multi-Spectral Image Segmentation
Abstract— Analyzing unknown data sets such as multispectral images often requires unsupervised techniques. Data clustering is a well known and widely used approach in such cases....
Danielle Nuzillard, Cosmin Lazar
APPROX
2006
Springer
88views Algorithms» more  APPROX 2006»
13 years 11 months ago
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
Leah Epstein, Magnús M. Halldórsson,...
OPODIS
2004
13 years 9 months ago
A Hierarchy-Based Fault-Local Stabilizing Algorithm for Tracking in Sensor Networks
In this paper, we introduce the concept of hierarchy-based fault-local stabilization and a novel self-healing/fault-containment technique and apply them in Stalk. Stalk is an algo...
Murat Demirbas, Anish Arora, Tina Nolte, Nancy A. ...
ATAL
2010
Springer
13 years 8 months ago
Coalition formation with spatial and temporal constraints
The coordination of emergency responders and robots to undertake a number of tasks in disaster scenarios is a grand challenge for multi-agent systems. Central to this endeavour is...
Sarvapali D. Ramchurn, Maria Polukarov, Alessandro...
TC
1998
13 years 7 months ago
Optimal Elections in Faulty Loop Networks and Applications
—Loop networks (or Hamiltonian circulant graphs) are a popular class of fault-tolerant network topologies which include rings and complete graphs. For this class, the fundamental...
Bernard Mans, Nicola Santoro