Sciweavers

2657 search results - page 28 / 532
» On the complexity of hierarchical problem solving
Sort
View
TNN
1998
76views more  TNN 1998»
14 years 9 months ago
Multiobjective genetic algorithm partitioning for hierarchical learning of high-dimensional pattern spaces: a learning-follows-d
— In this paper, we present a novel approach to partitioning pattern spaces using a multiobjective genetic algorithm for identifying (near-)optimal subspaces for hierarchical lea...
Rajeev Kumar, Peter Rockett
ICDT
2010
ACM
141views Database» more  ICDT 2010»
15 years 1 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
IJAC
2007
116views more  IJAC 2007»
14 years 9 months ago
On the Complexity of the Whitehead Minimization Problem
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...
Abdó Roig, Enric Ventura, Pascal Weil
106
Voted
ECP
1997
Springer
128views Robotics» more  ECP 1997»
15 years 1 months ago
SINERGY: A Linear Planner Based on Genetic Programming
In this paper we describe SINERGY, which is a highly parallelizable, linear planning system that is based on the genetic programming paradigm. Rather than reasoning about the world...
Ion Muslea
TSMC
2008
147views more  TSMC 2008»
14 years 9 months ago
A New Approach for Solving Nonlinear Equations Systems
This paper proposes a new perspective for solving systems of complex nonlinear equations by simply viewing them as a multiobjective optimization problem. Every equation in the syst...
Crina Grosan, Ajith Abraham