Sciweavers

9842 search results - page 1852 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
GECCO
2009
Springer
175views Optimization» more  GECCO 2009»
14 years 2 months ago
Evolving soft robotic locomotion in PhysX
Given the complexity of the problem, genetic algorithms are one of the more promising methods of discovering control schemes for soft robotics. Since physically embodied evolution...
John Rieffel, Frank Saunders, Shilpa Nadimpalli, H...
GLOBE
2009
Springer
14 years 2 months ago
AGiDS: A Grid-Based Strategy for Distributed Skyline Query Processing
Skyline queries help users make intelligent decisions over complex data, where different and often conflicting criteria are considered. A challenging problem is to support skylin...
João B. Rocha-Junior, Akrivi Vlachou, Chris...
GPCE
2009
Springer
14 years 2 months ago
Safe composition of non-monotonic features
Programs can be composed from features. We want to verify automatically that all legal combinations of features can be composed safely without errors. Prior work on this problem a...
Martin Kuhlemann, Don S. Batory, Christian Kä...
HAIS
2009
Springer
14 years 2 months ago
Pareto-Based Multi-output Model Type Selection
In engineering design the use of approximation models (= surrogate models) has become standard practice for design space exploration, sensitivity analysis, visualization and optimi...
Dirk Gorissen, Ivo Couckuyt, Karel Crombecq, Tom D...
MCSS
2009
Springer
14 years 2 months ago
Dynamic Cross-Layer Spectrum Allocation for Multi-Band High-Rate UWB Systems
- In this paper, we investigate a new approach for the spectrum allocation in UWB systems. This approach consists in a cross-layer scheme that takes into consideration the differen...
Ayman Khalil, Matthieu Crussière, Jean-Fran...
« Prev « First page 1852 / 1969 Last » Next »