Sciweavers

840 search results - page 21 / 168
» The Complexity of the Extended GCD Problem
Sort
View
DLT
2009
13 years 5 months ago
Tight Bounds on the Descriptional Complexity of Regular Expressions
Abstract. We improve on some recent results on lower bounds for conversion problems for regular expressions. In particular we consider the conversion of planar deterministic finite...
Hermann Gruber, Markus Holzer
CDC
2008
IEEE
168views Control Systems» more  CDC 2008»
14 years 2 months ago
An information-driven framework for motion planning in robotic sensor networks: Complexity and experiments
Abstract— A geometric optimization based approach to deploy a mobile sensor network for the purpose of detecting and capturing mobile targets in the plane is presented in [1]. Th...
Rafael Fierro, Silvia Ferrari, Chenghui Cai
LATA
2010
Springer
14 years 5 months ago
Verifying Complex Continuous Real-Time Systems with Coinductive CLP(R)
Timed automata has been used as a powerful formalism for specifying, designing, and analyzing real time systems. We consider the generalization of timed automata to Pushdown Timed ...
Neda Saeedloei and Gopal Gupta
ICASSP
2011
IEEE
12 years 11 months ago
Particle algorithms for filtering in high dimensional state spaces: A case study in group object tracking
We briefly present the current state-of-the-art approaches for group and extended object tracking with an emphasis on particle methods which have high potential to handle complex...
Lyudmila Mihaylova, Avishy Carmi
CORR
2010
Springer
202views Education» more  CORR 2010»
13 years 7 months ago
The Complexity of Reasoning for Fragments of Autoepistemic Logic
Autoepistemic logic extends propositional logic by the modal operator L. A formula that is preceded by an L is said to be "believed". The logic was introduced by Moore ...
Nadia Creignou, Arne Meier, Michael Thomas, Heribe...