Sciweavers

14649 search results - page 317 / 2930
» Principles of problem solving
Sort
View
GECCO
2009
Springer
15 years 11 months ago
Problem decomposition using indirect reciprocity in evolved populations
Evolutionary problem decomposition techniques divide a complex problem into simpler subproblems, evolve individuals to produce subcomponents that solve the subproblems, and then a...
Heather Goldsby, Sherri Goings, Jeff Clune, Charle...
IPCCC
2007
IEEE
16 years 29 days ago
O(log n)-Localized Algorithms on the Coverage Problem in Heterogeneous Sensor Networks
In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. ...
My T. Thai, Yingshu Li, Feng Wang 0002
CCCG
2010
15 years 8 months ago
New variations of the reverse facility location problem
In this paper we consider a natural extension of the socalled reverse facility location problem which was introduced by Cabello et al. [3]. Given a set of n users and a set of m f...
Bhaswar B. Bhattacharya, Subhas C. Nandy
GECCO
2007
Springer
190views Optimization» more  GECCO 2007»
16 years 25 days ago
Analysis of evolutionary algorithms for the longest common subsequence problem
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
Thomas Jansen, Dennis Weyland
ISAAC
2004
Springer
88views Algorithms» more  ISAAC 2004»
16 years 22 hour ago
On the Range Maximum-Sum Segment Query Problem
The range minimum query problem, RMQ for short, is to preprocess a sequence of real numbers A[1 . . . n] for subsequent queries of the form: “Given indices i, j, what is the ind...
Kuan-Yu Chen, Kun-Mao Chao