Sciweavers

8009 search results - page 62 / 1602
» cans 2005
Sort
View
CPAIOR
2005
Springer
15 years 9 months ago
Symmetry Breaking and Local Search Spaces
The effects of combining search and modelling techniques can be complex and unpredictable, so guidelines are very important for the design and development of effective and robust s...
Steven David Prestwich, Andrea Roli
ECAL
2005
Springer
15 years 9 months ago
(Co)Evolution of (De)Centralized Neural Control for a Gravitationally Driven Machine
Using decentralized control structures for robot control can offer a lot of advantages, such as less complexity, better fault tolerance and more flexibility. In this paper the ev...
Steffen Wischmann, Martin Hülse, Frank Pasema...
ECSQARU
2005
Springer
15 years 9 months ago
Probabilistic Graphical Models for the Diagnosis of Analog Electrical Circuits
We describe an algorithm to build a graphical model—more precisely: a join tree representation of a Markov network—for a steady state analog electrical circuit. This model can ...
Christian Borgelt, Rudolf Kruse
152
Voted
ESA
2005
Springer
131views Algorithms» more  ESA 2005»
15 years 9 months ago
Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs
We introduce a new way to compute common intervals of K permutations based on a very simple and general notion of generators of common intervals. This formalism leads to simple an...
Anne Bergeron, Cedric Chauve, Fabien de Montgolfie...
ESA
2005
Springer
113views Algorithms» more  ESA 2005»
15 years 9 months ago
Optimal Integer Alphabetic Trees in Linear Time
Abstract. We show that optimal alphabetic binary trees can be constructed in O(n) time if the elements of the initial sequence are drawn from a domain that can be sorted in linear ...
T. C. Hu, Lawrence L. Larmore, J. David Morgenthal...