Sciweavers

900 search results - page 80 / 180
» On the observational theory of the CPS-calculus
Sort
View
ATVA
2009
Springer
173views Hardware» more  ATVA 2009»
16 years 27 days ago
Solving Parity Games in Practice
Parity games are 2-player games of perfect information and infinite duration that have important applications in automata theory and decision procedures (validity as well as model...
Oliver Friedmann, Martin Lange
CDC
2008
IEEE
129views Control Systems» more  CDC 2008»
16 years 24 days ago
Distributed motion constraints for algebraic connectivity of robotic networks
— This paper studies connectivity maintenance of robotic networks that communicate at discrete times and move in continuous space. We propose a distributed algorithm that allows ...
Michael Schuresko, Jorge Cortés
CDC
2008
IEEE
289views Control Systems» more  CDC 2008»
16 years 24 days ago
Robust H-infinity control for uncertain time-delay TCP/AQM network system
—A robust active queue management (AQM) scheme based on H-infinty theory is presented for the problem of congestion control in TCP communication networks. In TCP/IP networks, the...
Yuanwei Jing, Hongwei Wang, Georgi M. Dimirovski, ...
ACCV
2007
Springer
16 years 15 days ago
Backward Segmentation and Region Fitting for Geometrical Visibility Range Estimation
Abstract. We present a new application of computer vision: continuous measurement of the geometrical visibility range on inter-urban roads, solely based on a monocular image acquis...
Erwan Bigorgne, Jean-Philippe Tarel
COCO
2007
Springer
106views Algorithms» more  COCO 2007»
16 years 14 days ago
The Complexity of Polynomials and Their Coefficient Functions
We study the link between the complexity of a polynomial and that of its coefficient functions. Valiant’s theory is a good setting for this, and we start by generalizing one of V...
Guillaume Malod