Sciweavers

193 search results - page 9 / 39
» Solving the multiple competitive facilities location problem
Sort
View
GECCO
2008
Springer
141views Optimization» more  GECCO 2008»
13 years 8 months ago
Managing team-based problem solving with symbiotic bid-based genetic programming
Bid-based Genetic Programming (GP) provides an elegant mechanism for facilitating cooperative problem decomposition without an a priori specification of the number of team member...
Peter Lichodzijewski, Malcolm I. Heywood
ESA
2000
Springer
104views Algorithms» more  ESA 2000»
13 years 11 months ago
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Ma...
DAGSTUHL
1994
13 years 8 months ago
Competitive Strategies for Autonomous Systems
A strategy for working with incomplete information is called competitive if it solves each problem instance at a cost not exceeding the cost of an optimal solution (with full info...
Christian Icking, Rolf Klein
INFOCOM
1998
IEEE
13 years 11 months ago
Demand-based Radio Network Planning of Cellular Mobile Communication Systems
: This paper presents a demand-based engineering method for designing radio networks of cellularmobile communicationsystems. The proposed procedure is based on a forward-engineerin...
Kurt Tutschku
SOCIALCOM
2010
13 years 5 months ago
A Scalable Framework for Modeling Competitive Diffusion in Social Networks
Multiple phenomena often diffuse through a social network, sometimes in competition with one another. Product adoption and political elections are two examples where network diffus...
Matthias Broecheler, Paulo Shakarian, V. S. Subrah...