Sciweavers

107 search results - page 13 / 22
» Finding Compact BDDs Using Genetic Programming
Sort
View
IPPS
2006
IEEE
14 years 22 days ago
Multiple sequence alignment by quantum genetic algorithm
In this paper we describe a new approach for the well known problem in bioinformatics: Multiple Sequence Alignment (MSA). MSA is fundamental task as it represents an essential pla...
L. Abdesslem, M. Soham, B. Mohamed
ECAI
2006
Springer
13 years 8 months ago
Return of the JTMS: Preferences Orchestrate Conflict Learning and Solution Synthesis
We use a lexicographical preference order on the problem space to combine solution synthesis with conflict learning. Given two preferred solutions of two subproblems, we can either...
Ulrich Junker, Olivier Lhomme
ATAL
2010
Springer
13 years 1 months ago
Approximate dynamic programming with affine ADDs
The Affine ADD (AADD) is an extension of the Algebraic Decision Diagram (ADD) that compactly represents context-specific, additive and multiplicative structure in functions from a...
Scott Sanner, William T. B. Uther, Karina Valdivia...
ETD2000
1995
13 years 10 months ago
Automatic generation of a neural network architecture using evolutionary computation
This paper reports the application of evolutionary computation in the automatic generation of a neural network architecture.It is a usual practice to use trial and error to find a...
E. Vonk, Lakhmi C. Jain, L. P. J. Veelenturf, R. J...
ATAL
2010
Springer
13 years 7 months ago
Merging example plans into generalized plans for non-deterministic environments
We present a new approach for finding generalized contingent plans with loops and branches in situations where there is uncertainty in state properties and object quantities, but ...
Siddharth Srivastava, Neil Immerman, Shlomo Zilber...