Sciweavers

3894 search results - page 694 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
131
Voted
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
15 years 4 months ago
Memory with memory: soft assignment in genetic programming
Based in part on observations about the incremental nature of most state changes in biological systems, we introduce the idea of Memory with Memory in Genetic Programming (GP), wh...
Nicholas Freitag McPhee, Riccardo Poli
CVPR
2004
IEEE
16 years 5 months ago
Collaborative Tracking of Multiple Targets
Coalescence, meaning the tracker associates more than one trajectories to some targets while loses track for others, is a challenging problem for visual tracking of multiple targe...
Ting Yu, Ying Wu
IPPS
2009
IEEE
15 years 10 months ago
On the complexity of mapping pipelined filtering services on heterogeneous platforms
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
Anne Benoit, Fanny Dufossé, Yves Robert
ICC
2007
IEEE
185views Communications» more  ICC 2007»
15 years 9 months ago
Maximal Lifetime Rate and Power Allocation for Sensor Networks with Data Distortion Constraints
— We address a lifetime maximization problem for a single-hop wireless sensor network where multiple sensors encode and communicate their measurements of a Gaussian random source...
James C. F. Li, Subhrakanti Dey, Jamie S. Evans
PPSN
2000
Springer
15 years 6 months ago
Optimizing through Co-evolutionary Avalanches
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...
Stefan Boettcher, Allon G. Percus, Michelangelo Gr...