Sciweavers

1826 search results - page 141 / 366
» Using Random Forests in the Structured Language Model
Sort
View
CP
2007
Springer
15 years 8 months ago
Boosting Probabilistic Choice Operators
Probabilistic Choice Operators (PCOs) are convenient tools to model uncertainty in CP. They are useful to implement randomized algorithms and stochastic processes in the concurrent...
Matthieu Petit, Arnaud Gotlieb
ICALP
2005
Springer
15 years 8 months ago
Quantum Complexity of Testing Group Commutativity
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...
Frédéric Magniez, Ashwin Nayak
117
Voted
ISORC
1998
IEEE
15 years 6 months ago
Compositional Specification and Structured Verification of Hybrid Systems in cTLA
Many modern chemical plants have to be modelled as complex hybrid systems consisting of various continuous and event-discrete components. Besides of the modular and easy-to-read s...
Peter Herrmann, Günter Graw, Heiko Krumm
PODC
2010
ACM
15 years 6 months ago
A modular approach to shared-memory consensus, with applications to the probabilistic-write model
We define two new classes of shared-memory objects: ratifiers, which detect agreement, and conciliators, which ensure agreement with some probability. We show that consensus can...
James Aspnes
CICLING
2009
Springer
16 years 3 months ago
Cross-Language Frame Semantics Transfer in Bilingual Corpora
Recent work on the transfer of semantic information across languages has been recently applied to the development of resources annotated with Frame information for different non-En...
Roberto Basili, Diego De Cao, Danilo Croce, Bonave...