2214 search results - page 285 / 443 » complexity 2004 |
150
click to vote
TIME
2009
IEEE
15 years 11 months ago
2009
IEEE
The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the...
117
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
Register allocation is NP-complete in general but can be solved in linear time for straight-line programs where each variable has at most one definition point if the bank of regis...
123
click to vote
ICRA
2005
IEEE
15 years 10 months ago
2005
IEEE
— In this paper, we introduce RoboKing, a national contest of mobile autonomous robots, dedicated to teams of high school students. RoboKing differs from similar contests by supp...
132
click to vote
IPPS
2005
IEEE
15 years 10 months ago
2005
IEEE
The Web Service Resource Framework (WSRF) was announced in January 2004 as a new way for manipulating "stateful resources" to perform grid computing tasks using Web Serv...
136
click to vote
DIGRA
2005
Springer
15 years 10 months ago
2005
Springer
RPG’s (Role Playing Games) and improvisational theatre have some obvious similarities. Both require the participants to work together in real-time to construct dynamic narrative...