Sciweavers

3220 search results - page 164 / 644
» Constrained Graph Processes
Sort
View
CEC
2009
IEEE
16 years 1 months ago
Representation and structural biases in CGP
— An evolutionary algorithm automatically discovers suitable solutions to a problem, which may lie anywhere in a large search space of candidate solutions. In the case of Genetic...
Andrew J. Payne, Susan Stepney
CDC
2008
IEEE
102views Control Systems» more  CDC 2008»
16 years 1 months ago
Area-constrained coverage optimization by robotic sensor networks
Abstract— This paper studies robotic sensor networks performing coverage optimization tasks with area constraints. The network coverage of the environment is a function of the ro...
Jorge Cortés
DDECS
2008
IEEE
137views Hardware» more  DDECS 2008»
16 years 1 months ago
Cluster-based Simulated Annealing for Mapping Cores onto 2D Mesh Networks on Chip
Abstract—In Network-on-Chip (NoC) application design, coreto-node mapping is an important but intractable optimization problem. In the paper, we use simulated annealing to tackle...
Zhonghai Lu, Lei Xia, Axel Jantsch
AUSAI
2003
Springer
16 years 2 days ago
Reduction of Non Deterministic Automata for Hidden Markov Model Based Pattern Recognition Applications
Most on-line cursive handwriting recognition systems use a lexical constraint to help improve the recognition performance. Traditionally, the vocabulary lexicon is stored in a trie...
Frédéric Maire, Frank Wathne, Alain ...
CVPR
2010
IEEE
15 years 11 months ago
"Lattice Cut" - Constructing superpixels using layer constraints
Unsupervised over-segmentation of an image into superpixels is a common preprocessing step for image parsing algorithms. Superpixels are used as both regions of support for featur...
Alastair Moore, Simon Prince