831 search results - page 120 / 167 » Sweeping with Continuous Domains |
GECCO
2006
Springer
14 years 10 days ago
2006
Springer
This paper proposes an adaptive discretization method, called Split-on-Demand (SoD), to enable the probabilistic model building genetic algorithm (PMBGA) to solve optimization pro...
COORDINATION
2000
Springer
14 years 9 days ago
2000
Springer
Abstract. Tuple spaces have turned out to be one of the most fundamental abstractions for coordinating communicating agents. At the same time, researchers continue to propose new v...
CVPR
2010
IEEE
14 years 8 days ago
2010
IEEE
We introduce a new algorithm for video retargeting that uses discontinuous seam-carving in both space and time for resizing videos. Our algorithm relies on a novel appearance-base...
DL
1995
Springer
14 years 7 days ago
1995
Springer
The research field of digital libraries must be viewed as a union of subfields from a variety of domains combined with new research issues in order to realize its full potential....
GECCO
2010
Springer
14 years 3 days ago
2010
Springer
Originally, genetic algorithms were developed based on the binary representation of candidate solutions in which each conjectured solution is a fixed-length string of binary numb...