Sciweavers

1058 search results - page 32 / 212
» It's Doomed; We Can Prove It
Sort
View
ICGI
1998
Springer
14 years 2 months ago
Learning Stochastic Finite Automata from Experts
We present in this paper a new learning problem called learning distributions from experts. In the case we study the experts are stochastic deterministic finite automata (sdfa). W...
Colin de la Higuera
UIST
2010
ACM
13 years 7 months ago
UIMarks: quick graphical interaction with specific targets
This paper reports on the design and evaluation of UIMarks, a system that lets users specify on-screen targets and associated actions by means of a graphical marking language. UIM...
Olivier Chapuis, Nicolas Roussel
JUCS
2002
73views more  JUCS 2002»
13 years 9 months ago
Some Remarks on Codes Defined by Petri Nets
: With any Petri net we associated its CPN language which consists of all sequences of transitions which reach a marking with an empty place whereas all proper prefixes of the sequ...
Masami Ito, Jürgen Dassow, Ralf Stiebe
FMCAD
2007
Springer
14 years 4 months ago
Modeling Time-Triggered Protocols and Verifying Their Real-Time Schedules
Time-triggered systems are distributed systems in which the nodes are independently-clocked but maintain synchrony with one another. Time-triggered protocols depend on the synchro...
Lee Pike
FORTE
2007
13 years 11 months ago
The DHCP Failover Protocol: A Formal Perspective
Abstract. We present a formal specification and analysis of a faulttolerant DHCP algorithm, used to automatically configure certain host parameters in an IP network. Our algorith...
Rui Fan, Ralph E. Droms, Nancy D. Griffeth, Nancy ...