2467 search results - page 378 / 494 » Finite State Machines |
173
click to vote
ECWEB
2007
Springer
16 years 18 days ago
2007
Springer
Service matchmaking is the process of finding appropriate services for a given set of requirements. We present a novel service matchmaking approach based on the internal process o...
158
click to vote
ISOLA
2007
Springer
16 years 17 days ago
2007
Springer
The testing and formal verification of black box software components is a challenging domain. The problem is even harder when specifications of these components are not available...
178
click to vote
ICPADS
2006
IEEE
16 years 14 days ago
2006
IEEE
Flexible resource management and scheduling policies require detailed system-state information. Traditional, monolithic operating systems with a centralized kernel derive the requ...
168
click to vote
IPPS
2006
IEEE
16 years 14 days ago
2006
IEEE
After having drawn up a state of the art on the theoretical feasibility of a system of periodic tasks scheduled by a preemptive algorithm at fixed priorities, we show in this art...
165
click to vote
DSN
2005
IEEE
16 years 1 days ago
2005
IEEE
— We present the first protocol that reaches asynchronous Byzantine consensus in two communication steps in the common case. We prove that our protocol is optimal in terms of bo...