3169 search results - page 304 / 634 » Robust Timed Automata |
177
click to vote
GECCO
2005
Springer
16 years 4 days ago
2005
Springer
We explore several different techniques in our quest to improve the overall model performance of a genetic algorithm calibrated probabilistic cellular automata. We use the Kappa ...
163
click to vote
WDAG
2005
Springer
16 years 2 days ago
2005
Springer
Atomicity (or linearizability) is a commonly used consistency criterion for distributed services and objects. Although atomic object implementations are abundant, proving that algo...
202
click to vote
FOIKS
2004
Springer
16 years 5 hour ago
2004
Springer
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...
195
click to vote
ICSOC
2004
Springer
15 years 12 months ago
2004
Springer
The e-services paradigm promises to enable rich, flexible, and dynamic inter-operation of highly distributed, heterogeneous networkenabled services. Among the challenges, a funda...
183
click to vote
CONCUR
2001
Springer
15 years 11 months ago
2001
Springer
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...