Sciweavers

5100 search results - page 696 / 1020
» The Linear Complexity of a Graph
Sort
View
193
Voted
AISC
2010
Springer
15 years 11 months ago
Symbolic Domain Decomposition
Decomposing the domain of a function into parts has many uses in mathematics. A domain may naturally be a union of pieces, a function may be defined by cases, or different bounda...
Jacques Carette, Alan P. Sexton, Volker Sorge, Ste...
CDC
2009
IEEE
113views Control Systems» more  CDC 2009»
15 years 11 months ago
Computation of safety control for uncertain piecewise continuous systems on a partial order
— In this paper, the safety control problem for a class of hybrid systems with disturbance inputs and imperfect continuous state information is considered. Under the assumption t...
Michael R. Hafner, Domitilla Del Vecchio
CEC
2009
IEEE
15 years 11 months ago
Memory-enhanced Evolutionary Robotics: The Echo State Network Approach
— Interested in Evolutionary Robotics, this paper focuses on the acquisition and exploitation of memory skills. The targeted task is a well-studied benchmark problem, the Tolman ...
Cédric Hartland, Nicolas Bredeche, Mich&egr...
ICANN
2009
Springer
15 years 11 months ago
Constrained Learning Vector Quantization or Relaxed k-Separability
Neural networks and other sophisticated machine learning algorithms frequently miss simple solutions that can be discovered by a more constrained learning methods. Transition from ...
Marek Grochowski, Wlodzislaw Duch
WABI
2001
Springer
138views Bioinformatics» more  WABI 2001»
15 years 11 months ago
Algorithms for Finding Gene Clusters
Abstract. Comparing gene orders in completely sequenced genomes is a standard approach to locate clusters of functionally associated genes. Often, gene orders are modeled as permut...
Steffen Heber, Jens Stoye