Sciweavers

1197 search results - page 145 / 240
» Which Dynamic Constraint Problems Can Be Solved By Ants
Sort
View
GECCO
2009
Springer
193views Optimization» more  GECCO 2009»
14 years 25 days ago
Optimization of dynamic memory managers for embedded systems using grammatical evolution
New portable consumer embedded devices must execute multimedia applications (e.g., 3D games, video players and signal processing software, etc.) that demand extensive memory acces...
José L. Risco-Martín, David Atienza,...
MDM
2010
Springer
188views Communications» more  MDM 2010»
13 years 6 months ago
A Distributed Technique for Dynamic Operator Placement in Wireless Sensor Networks
—We present an optimal distributed algorithm to adapt the placement of a single operator in high communication cost networks, such as a wireless sensor network. Our parameterfree...
Georgios Chatzimilioudis, Nikos Mamoulis, Dimitrio...
IPCO
2007
126views Optimization» more  IPCO 2007»
13 years 9 months ago
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
René Beier, Heiko Röglin, Berthold V&o...
LPNMR
2009
Springer
14 years 2 months ago
Application of ASP for Automatic Synthesis of Flexible Multiprocessor Systems from Parallel Programs
Configurable on chip multiprocessor systems combine advantages of task-level parallelism and the flexibility of field-programmable devices to customize architectures for paralle...
Harold Ishebabi, Philipp Mahr, Christophe Bobda, M...
AIIA
2003
Springer
14 years 1 months ago
Evolving the Neural Controller for a Robotic Arm Able to Grasp Objects on the Basis of Tactile Sensors
We describe the results of a set of evolutionary experiments in which a simulated robotic arm provided with a two-fingered hand has to reach and grasp objects with different shape...
Raffaele Bianco, Stefano Nolfi