Sciweavers

895 search results - page 112 / 179
» An Indirect Genetic Algorithm for Set Covering Problems
Sort
View
IJWIN
2006
209views more  IJWIN 2006»
14 years 11 months ago
On Connected Multiple Point Coverage in Wireless Sensor Networks
Abstract-- We consider a wireless sensor network consisting of a set of sensors deployed randomly. A point in the monitored area is covered if it is within the sensing range of a s...
Shuhui Yang, Fei Dai, Mihaela Cardei, Jie Wu, Floy...
COMPGEOM
2010
ACM
15 years 4 months ago
The 2-center problem in three dimensions
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
Pankaj K. Agarwal, Rinat Ben Avraham, Micha Sharir
SODA
2012
ACM
243views Algorithms» more  SODA 2012»
13 years 1 months ago
Bidimensionality and geometric graphs
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
GRAPHICSINTERFACE
2007
15 years 12 days ago
Optimized tile-based texture synthesis
One significant problem in tile-based texture synthesis is the presence of conspicuous seams in the tiles. The reason is that the sample patches employed as primary patterns of t...
Weiming Dong, Ning Zhou, Jean-Claude Paul
GECCO
2004
Springer
135views Optimization» more  GECCO 2004»
15 years 4 months ago
CellNet Co-Ev: Evolving Better Pattern Recognizers Using Competitive Co-evolution
A model for the co-evolution of patterns and classifiers is presented. The CellNet system for generating binary classifiers is used as a base for experimentation. The CellNet syste...
Taras Kowaliw, Nawwaf N. Kharma, Chris Jensen, Hus...