Sciweavers

4565 search results - page 641 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
IJCAI
2001
15 years 4 months ago
Backtracking Through Biconnected Components of a Constraint Graph
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
Jean-François Baget, Yannic S. Tognetti
ICML
2010
IEEE
15 years 3 months ago
Random Spanning Trees and the Prediction of Weighted Graphs
We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the...
Nicolò Cesa-Bianchi, Claudio Gentile, Fabio...
AUTOMATICA
2007
65views more  AUTOMATICA 2007»
15 years 3 months ago
Passivity-based designs for synchronized path-following
— We consider a formation control system where individual systems are controlled by a path-following design and the path variables are to be synchronized. We first show a passiv...
Ivar-André F. Ihle, Murat Arcak, Thor I. Fo...
IJAIT
2007
180views more  IJAIT 2007»
15 years 2 months ago
Detection and Prediction of Rare Events in Transaction Databases
Rare events analysis is an area that includes methods for the detection and prediction of events, e.g. a network intrusion or an engine failure, that occur infrequently and have s...
Christos Berberidis, Ioannis P. Vlahavas
DISOPT
2008
89views more  DISOPT 2008»
15 years 2 months ago
Group sequencing around a common due date
The problem of scheduling groups of jobs on a single machine under the group technology assumption is studied. Jobs of the same group are processed contiguously and a sequence ind...
T. C. Edwin Cheng, Mikhail Y. Kovalyov, C. T. Ng, ...