Sciweavers

446 search results - page 53 / 90
» Extremal Stable Graphs
Sort
View
ACC
2011
164views more  ACC 2011»
13 years 11 months ago
IMS and Presence Service Integration on Intelligent Transportation Systems for Future Services
Once some stable solutions appear to be found at physical and network layers for cooperative Intelligent Transportation Systems (ITS), deploying vehicular services and managing the...
Andrés Garcia, José Santa, Antonio M...
CDC
2009
IEEE
130views Control Systems» more  CDC 2009»
15 years 4 months ago
Modal and transition dwell time computation in switching systems: a set-theoretic approach
We consider a plant the dynamics of which switch among a family of systems. Each of these systems has a single stable equilibrium point. We assume that a constraint region for the...
Franco Blanchini, Daniele Casagrande, Stefano Mian...
STOC
1997
ACM
257views Algorithms» more  STOC 1997»
15 years 4 months ago
Practical Loss-Resilient Codes
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
ICSM
2005
IEEE
15 years 5 months ago
Comparison of Clustering Algorithms in the Context of Software Evolution
To aid software analysis and maintenance tasks, a number of software clustering algorithms have been proposed to automatically partition a software system into meaningful subsyste...
Jingwei Wu, Ahmed E. Hassan, Richard C. Holt
COMPGEOM
2004
ACM
15 years 5 months ago
On locally Delaunay geometric graphs
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...
Rom Pinchasi, Shakhar Smorodinsky