Sciweavers

283 search results - page 35 / 57
» Incremental Deterministic Planning
Sort
View
CEC
2010
IEEE
13 years 8 months ago
An examination on the modularity of grammars in grammatical evolutionary design
Abstract-- This work furthers the understanding of modularity in grammar-based genetic programming approaches by analyzing how different grammars may be capable of producing the sa...
John Mark Swafford, Michael O'Neill
ICDE
2010
IEEE
227views Database» more  ICDE 2010»
14 years 7 months ago
Approximate Confidence Computation in Probabilistic Databases
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
Dan Olteanu, Jiewen Huang, Christoph Koch
WIA
2004
Springer
14 years 28 days ago
A BDD-Like Implementation of an Automata Package
In this paper we propose a new data structure, called shared automata, for representing deterministic finite automata (DFA). Shared automata admit a strong canonical form for DFA ...
Jean-Michel Couvreur
ECML
1998
Springer
13 years 11 months ago
Predicate Invention and Learning from Positive Examples Only
Previous bias shift approaches to predicate invention are not applicable to learning from positive examples only, if a complete hypothesis can be found in the given language, as ne...
Henrik Boström
CAL
2006
13 years 7 months ago
Probabilistic counter updates for predictor hysteresis and bias
Hardware predictor designers have incorporated hysteresis and/or bias to achieve desired behavior by increasing the number of bits per counter. Some resulting proposed predictor de...
Nicholas Riley, Craig B. Zilles