Sciweavers

534 search results - page 30 / 107
» Efficient polynomial L-approximations
Sort
View
COLT
2008
Springer
13 years 9 months ago
Adaptive Aggregation for Reinforcement Learning with Efficient Exploration: Deterministic Domains
We propose a model-based learning algorithm, the Adaptive Aggregation Algorithm (AAA), that aims to solve the online, continuous state space reinforcement learning problem in a de...
Andrey Bernstein, Nahum Shimkin
ECAI
2008
Springer
13 years 9 months ago
Towards Efficient Belief Update for Planning-Based Web Service Composition
At the "functional level", Semantic Web Services (SWS) are described akin to planning operators, with preconditions and effects relative to an ontology; the ontology prov...
Jörg Hoffmann
EUROCRYPT
2008
Springer
13 years 9 months ago
Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme
In the model of perfectly secure message transmission schemes (PSMTs), there are n channels between a sender and a receiver. An infinitely powerful adversary A may corrupt (observe...
Kaoru Kurosawa, Kazuhiro Suzuki
COLING
1990
13 years 9 months ago
Efficient Disjunctive Unification for Bottom-Up Parsing
This paper describes two novel techniques which, when applied together, in practice significantly reduce the time required for unifying disjunctive feature structures. The first i...
David M. Carter
JALC
2006
133views more  JALC 2006»
13 years 7 months ago
Power and Efficiency of Minimal Parallelism in Polarizationless P Systems
Minimal parallelism was recently introduced [3] as a way of using the rules of a P system: from each set of applicable rules associated to a membrane, at least one rule must be ap...
Tseren-Onolt Ishdorj