Sciweavers

2467 search results - page 377 / 494
» Finite State Machines
Sort
View
DSN
2007
IEEE
15 years 7 months ago
How to Choose a Timing Model?
When employing a consensus algorithm for state machine replication, should one optimize for the case that all communication links are usually timely, or for fewer timely links? Do...
Idit Keidar, Alexander Shraer
99
Voted
ICDM
2007
IEEE
138views Data Mining» more  ICDM 2007»
15 years 7 months ago
Bandit-Based Algorithms for Budgeted Learning
We explore the problem of budgeted machine learning, in which the learning algorithm has free access to the training examples’ labels but has to pay for each attribute that is s...
Kun Deng, Chris Bourke, Stephen D. Scott, Julie Su...
IJCNN
2007
IEEE
15 years 7 months ago
A Closed Form Solution for Multiple-Input Spike Based Adaptive Filters
— Neurons are point process systems, in the sense that the inputs and output which are spike trains can be treated as point processes. System identification of a point process s...
Il Park, António R. C. Paiva, Jose C. Princ...
75
Voted
VR
2007
IEEE
15 years 7 months ago
Muddleware for Prototyping Mixed Reality Multiuser Games
We present Muddleware, a communication platform designed for mixed reality multi-user games for mobile, lightweight clients. An approach inspired by Tuplespaces, which provides de...
Dieter Wagner, Dieter Schmalstieg
97
Voted
B
2007
Springer
15 years 6 months ago
Modelling and Proof Analysis of Interrupt Driven Scheduling
Following a brief discussion of uniprocessor scheduling in which we argue the case for formal analysis, we describe a distributed Event B model of interrupt driven scheduling. We ...
Bill Stoddart, Dominique Cansell, Frank Zeyda