Sciweavers

304 search results - page 29 / 61
» Exploiting problem structure in a genetic algorithm approach...
Sort
View
AAAI
2007
13 years 10 months ago
Anytime Coordination Using Separable Bilinear Programs
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
Marek Petrik, Shlomo Zilberstein
EVOW
2007
Springer
14 years 1 months ago
Modeling the Shoot Apical Meristem in A. thaliana : Parameter Estimation for Spatial Pattern Formation
Understanding the self-regulatory mechanisms controlling the spatial and temporal structure of multicellular organisms represents one of the major challenges in molecular biology. ...
Tim Hohm, Eckart Zitzler
ICIP
2010
IEEE
13 years 5 months ago
Learning simple texture discrimination filters
Current texture analysis methods enable good discrimination but are computationally too expensive for applications which require high frame rates. This occurs because they use red...
Rui F. C. Guerreiro, Pedro M. Q. Aguiar
EH
1999
IEEE
351views Hardware» more  EH 1999»
14 years 3 days ago
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
Here we advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The method involves training on examples, constraint...
Marek A. Perkowski, Alan Mishchenko, Anatoli N. Ch...
LSSC
2005
Springer
14 years 1 months ago
Improved Solution Enclosures for Over- and Underdetermined Interval Linear Systems
Abstract. In this paper we discuss an inclusion method for solving rectangular (over- and under-determined) dense linear systems where the input data are uncertain and vary within ...
Evgenija D. Popova