58 search results - page 11 / 12 » Graph Invariants as Necessary Conditions for Global Constrai... |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Contrary to the sequential world, the processes involved in a distributed system do not necessarily know when a computation is globally finished. This paper investigates the proble...
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
Abstract—The paper studies the convergence properties of the estimation error processes in distributed Kalman filtering for potentially unstable linear dynamical systems. In par...
SPAA
2003
ACM
13 years 11 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
WINE
2009
Springer
14 years 10 days ago
2009
Springer
We study the geometrical shape of the partitions of the input space created by the allocation rule of a truthful mechanism for multi-unit auctions with multidimensional types and ...
JHSN
2000
13 years 5 months ago
2000
A shaper is a system that stores incoming bits in a bu er and delivers them as early as possible, while forcing the output to be constrained with a given arrival curve. A shaper i...