Sciweavers

1254 search results - page 39 / 251
» Making Hard Problems Harder
Sort
View
GECCO
2009
Springer
199views Optimization» more  GECCO 2009»
15 years 5 months ago
Using behavioral exploration objectives to solve deceptive problems in neuro-evolution
Encouraging exploration, typically by preserving the diversity within the population, is one of the most common method to improve the behavior of evolutionary algorithms with dece...
Jean-Baptiste Mouret, Stéphane Doncieux
109
Voted
GECCO
2007
Springer
179views Optimization» more  GECCO 2007»
15 years 6 months ago
The second harmonic generation case-study as a gateway for es to quantum control problems
The Second Harmonic Generation (SHG), a process that turns out to be a good test case in the physics lab, can also be considered as a fairly simple theoretical test function for g...
Ofer M. Shir, Thomas Bäck
DRM
2005
Springer
15 years 6 months ago
Watermarking and ownership problem: a revisit
Watermarking technologies have been envisioned as a potential means for establishing ownership on digital media objects. However, achievable robustness and false-positive rates of...
Husrev T. Sencar, Nasir D. Memon
100
Voted
AMAI
2005
Springer
15 years 13 days ago
A SAT approach to query optimization in mediator systems
Mediator systems integrate distributed, heterogeneous and autonomous data sources, but their e ective use requires the solution of hard query optimization problems. This is usuall...
Steven David Prestwich, Stéphane Bressan
ENDM
2008
142views more  ENDM 2008»
15 years 18 days ago
Augmenting the Connectivity of Planar and Geometric Graphs
In this paper we study some connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) ...
Ignaz Rutter, Alexander Wolff