585 search results - page 51 / 117 » Better Abstractions for Timed Automata |
121
Voted
COCOON
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
102
click to vote
CORR
2002
Springer
15 years 10 days ago
2002
Springer
Abstract. We study algorithms for computing stable models of propositional logic programs and derive estimates on their worst-case performance that are asymptotically better than t...
112
Voted
ICLP
2005
Springer
15 years 6 months ago
2005
Springer
We present a methodology for the modeling of complex program behavior in CLP. In the first part we present an informal description about how to represent a system in CLP. At its ...
105
Voted
VLSID
1998
IEEE
15 years 4 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...
85
Voted
HOTOS
1999
IEEE
15 years 4 months ago
1999
IEEE
The file is a well-understood and very simple abstraction, which has been successfully used in both centralized and distributed systems. However, files are not expressive enough t...