3229 search results - page 147 / 646 » The Theory of Timed Automata |
177
click to vote
VLSID
1998
IEEE
15 years 10 months ago
1998
IEEE
With several commercial tools becoming available, the high-level synthesis of applicationspeci c integrated circuits is nding wide spread acceptance in VLSI industry today. Existi...
141
click to vote
COCO
2006
Springer
15 years 10 months ago
2006
Springer
We establish a close connection between (sub)exponential time complexity and parameterized complexity by proving that the so-called miniaturization mapping is a reduction preservi...
149
click to vote
ACL
1998
15 years 7 months ago
1998
Since the early Sixties and Seventies it has been known that the regular and context-free languages arc characterized by definability in the monadic second-order theory of certain...
204
click to vote
JAISE
2010
15 years 1 months ago
2010
The ability to identify the behavior of people in a home is at the core of Smart Home functionality. Such environments are equipped with sensors that unobtrusively capture informat...
151
click to vote
AAAI
2000
15 years 7 months ago
2000
We introduce new linear time algorithms for satisfiability of binary propositional theories (2-SAT), and for recognition and satisfiability of renamable Horn theories. The algorit...