Sciweavers

1561 search results - page 172 / 313
» Probability Theory on IF Events
Sort
View
121
Voted
TASE
2008
IEEE
14 years 10 months ago
Modeling and Supervisory Control of Railway Networks Using Petri Nets
In this paper we deal with the problem of modeling railway networks with Petri nets so as to apply the theory of supervisory control for discrete event systems to automatically de...
Alessandro Giua, Carla Seatzu
77
Voted
STOC
1993
ACM
117views Algorithms» more  STOC 1993»
15 years 2 months ago
Efficient noise-tolerant learning from statistical queries
In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the cl...
Michael J. Kearns
87
Voted
ATAL
2008
Springer
15 years 7 days ago
Complexity of terminating preference elicitation
Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating togethe...
Toby Walsh
CORR
2008
Springer
118views Education» more  CORR 2008»
14 years 10 months ago
Distributed Constrained Optimization with Semicoordinate Transformations
Recent work has shown how information theory extends conventional full-rationality game theory to allow bounded rational agents. The associated mathematical framework can be used ...
William G. Macready, David Wolpert
84
Voted
CORR
2007
Springer
127views Education» more  CORR 2007»
14 years 10 months ago
Using decision problems in public key cryptography
There are several public key establishment protocols as well as complete public key cryptosystems based on allegedly hard problems from combinatorial (semi)group theory known by no...
Vladimir Shpilrain, Gabriel Zapata