Sciweavers

867 search results - page 46 / 174
» The Generalized Maximum Coverage Problem
Sort
View
VTC
2010
IEEE
180views Communications» more  VTC 2010»
13 years 6 months ago
Analysis of Enhanced Deployment Models for Sensor Networks
Abstract—We present the estimation and evaluation of deployment models for sensor networks that exploit different amounts of a priori information. Topologies generated from the m...
Frank Oldewurtel, Petri Mähönen
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
14 years 2 months ago
Evolutionary algorithms and matroid optimization problems
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
Joachim Reichel, Martin Skutella
ICTAI
2002
IEEE
14 years 1 months ago
Adjusted Network Flow for the Shelf-Space Allocation Problem
In this paper, we study shelf space allocation optimization which is important to retail operations management. Our approach is to formulate a model that is applicable to operatio...
Andrew Lim, Brian Rodrigues, Fei Xiao, Xingwen Zha...
FLAIRS
2006
13 years 9 months ago
Genetic Programming: Analysis of Optimal Mutation Rates in a Problem with Varying Difficulty
In this paper we test whether a correlation exists between the optimal mutation rate and problem difficulty. We find that the range of optimal mutation rates is inversely proporti...
Alan Piszcz, Terence Soule
DAM
2006
81views more  DAM 2006»
13 years 8 months ago
The satisfactory partition problem
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neigh...
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten