2632 search results - page 111 / 527 » Alternating Timed Automata |
138
click to vote
JALC
2006
15 years 3 months ago
2006
Automated Web Service Composition has gained a significant momentum in facilitating fast and efficient formation of business-to-business collaborations where an important objectiv...
140
click to vote
LICS
2007
IEEE
15 years 9 months ago
2007
IEEE
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
132
click to vote
ATVA
2006
Springer
15 years 7 months ago
2006
Springer
In synthesis we construct finite state systems from temporal specifications. While this problem is well understood in the classical setting of non-probabilistic synthesis, this pap...
130
Voted
KI
2007
Springer
15 years 9 months ago
2007
Springer
We propose a novel approach to experience collection for autonomous service robots performing complex activities. This approach enables robots to data for many learning problems at...
99
Voted
ACRI
2006
Springer
15 years 9 months ago
2006
Springer
This paper propose a maze routing algorithm based on cellular automata. The aim of this algorithm is find the shortest path between the source cell and the target cell , so that th...