Sciweavers

1404 search results - page 115 / 281
» Complexity of admissible rules
Sort
View
BIOSYSTEMS
2008
129views more  BIOSYSTEMS 2008»
13 years 9 months ago
Reconstruction of DNA sequences using genetic algorithms and cellular automata: Towards mutation prediction?
Change of DNA sequence that fuels evolution is, to a certain extent, a deterministic process because mutagenesis does not occur in an absolutely random manner. So far, it has not ...
Ch. Mizas, Georgios Ch. Sirakoulis, Vasilios A. Ma...
ACMACE
2008
ACM
13 years 11 months ago
BeatBender: subsumption architecture for autonomous rhythm generation
BeatBender is a computer music project that explores a new method for generating emergent rhythmic drum patterns using the subsumption architecture. Rather than explicitly coding ...
Aaron Levisohn, Philippe Pasquier
LREC
2010
168views Education» more  LREC 2010»
13 years 10 months ago
Formal Description of Resources for Ontology-based Semantic Annotation
Ontology-based semantic annotation aims at putting fragments of a text in correspondence with proper elements of an ontology such that the formal semantics encoded by the ontology...
Yue Ma, Adeline Nazarenko, Laurent Audibert
ICML
2009
IEEE
14 years 9 months ago
Approximate inference for planning in stochastic relational worlds
Relational world models that can be learned from experience in stochastic domains have received significant attention recently. However, efficient planning using these models rema...
Tobias Lang, Marc Toussaint
ICML
2008
IEEE
14 years 9 months ago
Empirical Bernstein stopping
Sampling is a popular way of scaling up machine learning algorithms to large datasets. The question often is how many samples are needed. Adaptive stopping algorithms monitor the ...
Csaba Szepesvári, Jean-Yves Audibert, Volod...