457 search results - page 30 / 92 » Upper and Lower Bounds on Continuous-Time Computation |
152
click to vote
COCO
2009
Springer
16 years 19 days ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
164
click to vote
MFCS
2004
Springer
15 years 11 months ago
2004
Springer
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...
173
click to vote
AUTOMATICA
2004
15 years 6 months ago
2004
This paper deals with feedback controller synthesis for timed event graphs in dioids, where the number of initial tokens and time delays are only known to belong to intervals. We ...
172
click to vote
ACSC
2005
IEEE
15 years 11 months ago
2005
IEEE
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
175
click to vote
AUTOMATICA
2008
15 years 6 months ago
2008
This paper proposes an algorithm for the characterization of reachable sets of states for continuous-time piecewise affine systems. Given a model of the system and a bounded set o...