2266 search results - page 229 / 454 » Evolutionary Algorithms for the Satisfiability Problem |
206
click to vote
NICSO
2010
Springer
15 years 10 months ago
2010
Springer
Subsumption architectures are a well-known model for behaviour-based robotic control. The overall behaviour is achieved by defining a hierarchy of increasingly sophisticated behav...
150
click to vote
ICCD
1999
IEEE
15 years 7 months ago
1999
IEEE
In this paper, we present a hierarchical evolutionary approach to hardware/software partitioning for real-time embedded systems. In contrast to most of previous approaches, we app...
153
click to vote
BIOCOMP
2006
15 years 4 months ago
2006
Computation of multiple sequence alignments is one of the major open problems in computational molecular biology. The purpose of this study was to provide a new method, PAC (Progre...
120
click to vote
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
This paper introduces a novel analogy with the way in which honeybee colonies operate in order to solve the problem of sparse and quasi dense reconstruction. To successfully solve...
134
click to vote
SAT
2005
Springer
15 years 8 months ago
2005
Springer
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the...