3750 search results - page 94 / 750 » Timed Automata Patterns |
WIA
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. Hopcroft’s algorithm for minimizing a deterministic automaton has complexity O(n log n). We show that this complexity bound is tight. More precisely, we provide a famil...
CSR
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. We introduce dynamic communicating automata (DCA), an extension of communicating finite-state machines that allows for dynamic creation of processes. Their behavior can ...
SIGSOFT
2008
ACM
13 years 10 months ago
2008
ACM
If an organization depends on the service quality provided by another organization it often enters into a bilateral service level agreement (SLA), which mitigates outsourcing risk...
WISE
2006
Springer
14 years 4 months ago
2006
Springer
Service composition is becoming the dominant paradigm for developing Web service applications. It is important to ensure that a service composition complies with the requirements f...
ICPR
2004
IEEE
14 years 12 months ago
2004
IEEE
Important factors affecting the efficiency and performance of the nearest neighbor classifier (NNC) are space, classification time requirements and for high dimensional data, due ...