Sciweavers

852 search results - page 63 / 171
» Functional Representation of Designs and Redesign Problem So...
Sort
View
134
Voted
GPEM
2008
128views more  GPEM 2008»
15 years 3 months ago
Coevolutionary bid-based genetic programming for problem decomposition in classification
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
Peter Lichodzijewski, Malcolm I. Heywood
133
Voted
PDCN
2004
15 years 5 months ago
Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...
136
Voted
ACSC
2005
IEEE
15 years 9 months ago
Graph Grammar Encoding and Evolution of Automata Networks
The global dynamics of automata networks (such as neural networks) are a function of their topology and the choice of automata used. Evolutionary methods can be applied to the opt...
Martin H. Luerssen
107
Voted
CADE
2006
Springer
16 years 4 months ago
Combining Type Theory and Untyped Set Theory
Abstract. We describe a second-order type theory with proof irrelevance. Within this framework, we give a representation of a form of Mac Lane set theory and discuss automated supp...
Chad E. Brown
139
Voted
ICIP
2008
IEEE
15 years 10 months ago
Atomic decomposition dedicated to AVC and spatial SVC prediction
In this work, we propose the use of sparse signal representation techniques to solve the problem of closed-loop spatial image prediction. The reconstruction of signal in the block...
Aurelie Martin, Jean-Jacques Fuchs, Christine Guil...