Sciweavers

2738 search results - page 100 / 548
» The Frobenius Problem and Its Generalizations
Sort
View
CDC
2008
IEEE
129views Control Systems» more  CDC 2008»
15 years 4 months ago
Rate of Convergence for Consensus with Delays
— We study the problem of reaching a consensus in the values of a distributed system of agents with time-varying connectivity in the presence of delays. We consider a widely stud...
Pierre-Alexandre Bliman, Angelia Nedic, Asuman E. ...
ICRA
2009
IEEE
137views Robotics» more  ICRA 2009»
15 years 4 months ago
An optimized Linear Model Predictive Control solver for online walking motion generation
— This article addresses the fast solution of a Quadratic Program underlying a Linear Model Predictive Control scheme that generates walking motions. We introduce an algorithm wh...
Dimitar Dimitrov, Pierre-Brice Wieber, Olivier Sta...
JACM
2000
119views more  JACM 2000»
14 years 9 months ago
A minimum spanning tree algorithm with Inverse-Ackermann type complexity
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
Bernard Chazelle
ICALP
1992
Springer
15 years 1 months ago
On Nearest-Neighbor Graphs
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
Mike Paterson, F. Frances Yao
SYNTHESE
2008
81views more  SYNTHESE 2008»
14 years 9 months ago
Decision framing in judgment aggregation
Judgment aggregation problems are language dependent in that they may be framed in different yet equivalent ways. We formalize this dependence via the notion of translation invari...
Fabrizio Cariani, Marc Pauly, Josh Snyder