516 search results - page 14 / 104 » Generalizing the Discrete Timed Automaton |
120
Voted
PODS
2007
ACM
16 years 1 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
108
click to vote
COMPGEOM
2001
ACM
15 years 5 months ago
2001
ACM
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
111
click to vote
COMPGEOM
1994
ACM
15 years 5 months ago
1994
ACM
We consider the problem of a robot which has to find a target in an unknown simple polygon, based only on what it has seen so far. A street is a polygon for which the two boundary...
103
click to vote
TIT
2008
15 years 1 months ago
2008
In this paper we study the scenario in which a server sends dynamic data over a single broadcast channel to a number of passive clients. We consider the data to consist of discret...
133
click to vote
EMSOFT
2010
Springer
14 years 11 months ago
2010
Springer
Correct and efficient implementation of general real-time applications remains by far an open problem. A key issue is meeting timing constraints whose satisfaction depends on feat...