Sciweavers

12825 search results - page 1934 / 2565
» Improved PLSOM algorithm
Sort
View
ACTAC
2007
69views more  ACTAC 2007»
15 years 7 months ago
Synthesising Robust Schedules for Minimum Disruption Repair Using Linear Programming
An o-line scheduling algorithm considers resource, precedence, and synchronisation requirements of a task graph, and generates a schedule guaranteeing its timing requirements. Th...
Dávid Hanák, Nagarajan Kandasamy
AUTOMATICA
2007
65views more  AUTOMATICA 2007»
15 years 7 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...
CORR
2010
Springer
90views Education» more  CORR 2010»
15 years 7 months ago
New Criteria for Iterative Decoding
Iterative decoding was not originally introduced as the solution to an optimization problem rendering the analysis of its convergence very difficult. In this paper, we investigate...
Florence Alberge, Ziad Naja, Pierre Duhamel
CORR
2010
Springer
165views Education» more  CORR 2010»
15 years 7 months ago
Online Learning: Beyond Regret
We study online learnability of a wide class of problems, extending the results of [26] to general notions of performance measure well beyond external regret. Our framework simult...
Alexander Rakhlin, Karthik Sridharan, Ambuj Tewari
DISOPT
2008
107views more  DISOPT 2008»
15 years 7 months ago
The k-path tree matroid and its applications to survivable network design
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
Esther M. Arkin, Refael Hassin
« Prev « First page 1934 / 2565 Last » Next »