852 search results - page 41 / 171 » entcs 2010 |
119
Voted
ENTCS
2007
15 years 3 months ago
2007
We endow the collection of ω-bifinite domains with the structure of a probability space, and we will show
101
Voted
ENTCS
2006
15 years 3 months ago
2006
act way to define rewriting logic Marc Aiguier a,1 , Diane Bahrami b , Delphine Longuet a a Universit
120
Voted
ENTCS
2006
15 years 3 months ago
2006
Computability theory, which investigates computable functions and computable sets, lies at the foundation of computer science. Its classical presentations usually involve a fair a...
106
Voted
ENTCS
2006
15 years 3 months ago
2006
In this paper, we present weighted/priced timed automata, an extension of timed automaton with costs, and solve several interesting problems on that model. Key words: Weighted/pri...