1404 search results - page 26 / 281 » Complexity of admissible rules |
CORR
2011
Springer
13 years 5 months ago
2011
Springer
—We present a method to eliminate redundancy in the transition tables of Boolean automata: schema redescription with two symbols. One symbol is used to capture redundancy of indi...
AUSDM
2008
Springer
14 years 10 days ago
2008
Springer
LBR is a highly accurate classification algorithm, which lazily constructs a single Bayesian rule for each test instance at classification time. However, its computational complex...
IPPS
1999
IEEE
14 years 2 months ago
1999
IEEE
We study how several collective operations like broadcast, reduction, scan, etc. can be composed efficiently in complex parallel programs. Our specific contributions are: (1) a fo...
AGI
2011
13 years 1 months ago
2011
We present an actor-critic scheme for reinforcement learning in complex domains. The main contribution is to show that planning and I/O dynamics can be separated such that an intra...
WECWIS
2003
IEEE
14 years 3 months ago
2003
IEEE
With the growing number of marketplaces and trading partners in the e–commerce environment, software tools designed to act on behalf of human traders are increasingly used to au...