2467 search results - page 378 / 494 » Finite State Machines |
117
Voted
ECWEB
2007
Springer
15 years 6 months 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...
105
click to vote
ISOLA
2007
Springer
15 years 6 months 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...
110
Voted
ICPADS
2006
IEEE
15 years 6 months 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...
IPPS
2006
IEEE
15 years 6 months 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...
107
Voted
DSN
2005
IEEE
15 years 6 months 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...