552 search results - page 39 / 111 » Lower bounds for dynamic connectivity |
FOSSACS
2007
Springer
14 years 3 months ago
2007
Springer
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
VMV
2008
13 years 11 months ago
2008
We propose an adaptive decomposition algorithm to compute separation distances between arbitrarily shaped objects. Using the Gilbert-JohnsonKeerthi algorithm (GJK), we search for ...
MMS
1998
13 years 9 months ago
1998
In packet audio applications, packets are buffered at a receiving site and their playout delayed in order to compensate for variable network delays. In this paper, we consider the ...
AUTOMATICA
2005
13 years 9 months ago
2005
This paper presents novel analysis results for input-to-state stability (ISS) that utilise dynamic programming techniques to characterise minimal ISS gains and transient bounds. Th...
AUTOMATICA
2010
13 years 9 months ago
2010
We propose a class of discrete-time dynamic average consensus algorithms that allow a group of agents to track the average of their reference inputs. The convergence results rely ...