Sciweavers

4403 search results - page 729 / 881
» Galois Theory of Algorithms
Sort
View
180
Voted
JEI
2007
144views more  JEI 2007»
15 years 7 months ago
Cost-based closed-contour representations
This paper presents an efficient technique for linking edge points in order to generate a closed-contour representation. It is based on the consecutive use of global and local sch...
Angel Domingo Sappa, Boris Xavier Vintimilla
TSMC
2008
146views more  TSMC 2008»
15 years 7 months ago
Decentralized Learning in Markov Games
Learning Automata (LA) were recently shown to be valuable tools for designing Multi-Agent Reinforcement Learning algorithms. One of the principal contributions of LA theory is tha...
Peter Vrancx, Katja Verbeeck, Ann Nowé
163
Voted
URBAN
2008
86views more  URBAN 2008»
15 years 7 months ago
Social area analysis, data mining, and GIS
: There is a long tradition of describing cities through a focus on the characteristics of their residents. A brief review of the history of this approach to describing cities high...
Seth E. Spielman, Jean-Claude Thill
177
Voted
AICOM
2002
103views more  AICOM 2002»
15 years 7 months ago
The emergent computational potential of evolving artificial living systems
The computational potential of artificial living systems can be studied without knowing the algorithms that govern their behavior. Modeling single organisms by means of socalled c...
Jirí Wiedermann, Jan van Leeuwen
APIN
2002
70views more  APIN 2002»
15 years 7 months ago
Compact Unstructured Representations for Evolutionary Design
This paper proposes a few steps to escape structured extensive representations for objects, in the context of evolutionary Topological Optimum Design (TOD) problems: early results ...
Hatem Hamda, François Jouve, Evelyne Lutton...