Sciweavers

435 search results - page 63 / 87
» Partitioning Search Spaces of a Randomized Search
Sort
View
GECCO
2007
Springer
172views Optimization» more  GECCO 2007»
15 years 4 months ago
Acquiring evolvability through adaptive representations
Adaptive representations allow evolution to explore the space of phenotypes by choosing the most suitable set of genotypic parameters. Although such an approach is believed to be ...
Joseph Reisinger, Risto Miikkulainen
GECCO
2009
Springer
15 years 1 months ago
Evolving heuristically difficult instances of combinatorial problems
When evaluating a heuristic for a combinatorial problem, randomly generated instances of the problem may not provide a thorough exploration of the heuristic's performance, an...
Bryant A. Julstrom
AAAI
2004
14 years 11 months ago
A Comparison of Techniques for Scheduling Earth Observing Satellites
Scheduling observations by coordinated fleets of Earth Observing Satellites (EOS) involves large search spaces, complex constraints and poorly understood bottlenecks; conditions w...
Al Globus, James Crawford, Jason D. Lohn, Anna Pry...
JAIR
2006
74views more  JAIR 2006»
14 years 9 months ago
Understanding Algorithm Performance on an Oversubscribed Scheduling Application
The best performing algorithms for a particular oversubscribed scheduling application, Air Force Satellite Control Network (AFSCN) scheduling, appear to have little in common. Yet...
Laura Barbulescu, Adele E. Howe, L. Darrell Whitle...
AROBOTS
2002
98views more  AROBOTS 2002»
14 years 9 months ago
Dynamically-Stable Motion Planning for Humanoid Robots
We present an approach to path planning for humanoid robots that computes dynamically-stable, collision-free trajectories from full-body posture goals. Given a geometric model of t...
James J. Kuffner Jr., Satoshi Kagami, Koichi Nishi...