4940 search results - page 259 / 988 » On the Complexity of Universal Programs |
165
click to vote
CAV
2007
Springer
15 years 10 months ago
2007
Springer
We present a simple and effective approximated backward reachability algorithm for parameterized systems with existentially and universally quantified global conditions. The indivi...
165
click to vote
ASAP
2006
IEEE
15 years 8 months ago
2006
IEEE
The paper starts presents the work initially carried out by Queen's University and RSRE (now Qinetiq) in the development of advanced architectures and microchips based on sys...
145
click to vote
BCSHCI
2008
15 years 8 months ago
2008
The purpose of this study is to understand the laggard adoption of an SMS-based emergency alert system on a university campus. Based on findings from in-depth interviews and a foc...
134
click to vote
ESANN
2004
15 years 8 months ago
2004
We derive analytical expressions of local codim-1-bifurcations for a fully connected, additive, discrete-time RNN, where we regard the external inputs as bifurcation parameters. Th...
155
click to vote
FSTTCS
2008
Springer
15 years 7 months ago
2008
Springer
We consider the isomorphism and canonization problem for 3-connected planar graphs. The problem was known to be L -hard and in UL ∩ coUL [TW08]. In this paper, we give a determin...