Sciweavers

2150 search results - page 43 / 430
» On a restricted cross-intersection problem
Sort
View
AAIM
2009
Springer
105views Algorithms» more  AAIM 2009»
15 years 4 months ago
On Acyclicity of Games with Cycles
We study restricted improvement cycles (ri-cycles) in finite positional n-person games with perfect information modeled by directed graphs (digraphs) that may contain cycles. We o...
Daniel Andersson, Vladimir Gurvich, Thomas Dueholm...
IWPC
2000
IEEE
15 years 2 months ago
Automated Quality Analysis of Component Software for Embedded Systems
The Java programming language has gained increasing importance for the development of embedded systems. To be cost efficient, such systems have to cope with significant hardware...
Jens H. Jahnke, Jörg Niere, Jörg P. Wads...
ACL
2009
14 years 7 months ago
Incremental Parsing with Monotonic Adjoining Operation
This paper describes an incremental parser based on an adjoining operation. By using the operation, we can avoid the problem of infinite local ambiguity in incremental parsing. Th...
Yoshihide Kato, Shigeki Matsubara
HYBRID
2000
Springer
15 years 1 months ago
Decidable Controller Synthesis for Classes of Linear Systems
A problem of great interest in the control of hybrid systems is the design of least restrictive controllers for reachability specifications. Controller design typically uses game t...
Omid Shakernia, Shankar Sastry, George J. Pappas
ENTCS
2008
87views more  ENTCS 2008»
14 years 9 months ago
The Complexity of Satisfiability for Fragments of CTL and CTL*
The satisfiability problems for CTL and CTL are known to be EXPTIME-complete, resp. 2EXPTIMEcomplete (Fischer and Ladner (1979), Vardi and Stockmeyer (1985)). For fragments that u...
Arne Meier, Martin Mundhenk, Michael Thomas, Herib...