Sciweavers

4377 search results - page 92 / 876
» Mass problems and randomness
Sort
View
SODA
2004
ACM
146views Algorithms» more  SODA 2004»
15 years 6 months ago
Approximating the two-level facility location problem via a quasi-greedy approach
We propose a quasi-greedy algorithm for approximating the classical uncapacitated 2-level facility location problem (2-LFLP). Our algorithm, unlike the standard greedy algorithm, ...
Jiawei Zhang
IFIP
2004
Springer
15 years 11 months ago
Solving Geometrical Place Problems by using Evolutionary Algorithms
Geometrical place can be sometimes difficult to find by applying mathematical methods. Evolutionary algorithms deal with a population of solutions. This population (initially ran...
Crina Grosan
EUROGP
2001
Springer
105views Optimization» more  EUROGP 2001»
15 years 10 months ago
Adaptive Genetic Programming Applied to New and Existing Simple Regression Problems
Abstract. In this paper we continue our study on adaptive genetic programming. We use Stepwise Adaptation of Weights (saw) to boost performance of a genetic programming algorithm o...
Jeroen Eggermont, Jano I. van Hemert
IPL
2007
94views more  IPL 2007»
15 years 5 months ago
The finite horizon investor problem with a budget constraint
We study a model that incorporates a budget constraint in a decision making problem. Our goal is to maximize the expected wealth, where in each time period we can either stop the ...
Asaf Levin
327
Voted
INFOCOM
2012
IEEE
13 years 8 months ago
Constant-approximation for target coverage problem in wireless sensor networks
—When a large amount of sensors are randomly deployed into a field, how can we make a sleep/activate schedule for sensors to maximize the lifetime of target coverage in the fie...
Ling Ding, Weili Wu, James Willson, Lidong Wu, Zai...