3433 search results - page 135 / 687 » Heuristics for a bidding problem |
171
click to vote
AE
2005
Springer
16 years 1 days ago
2005
Springer
This paper presents a new Memetic Algorithm designed to compute near optimal solutions for the MinLA problem. It incorporates a highly specialized crossover operator, a fast MinLA ...
146
click to vote
EVOW
2006
Springer
15 years 10 months ago
2006
Springer
This paper proposes an evolutionary algorithm (EA) that is applied to the traveling salesman problem (TSP). Existing approximation methods to address the TSP known to be state-of-t...
147
click to vote
COR
2008
15 years 6 months ago
2008
In this paper, an improved Two-Stage Simulated Annealing algorithm is presented for the Minimum Linear Arrangement Problem for Graphs. This algorithm integrates several distinguis...
168
click to vote
ANOR
2011
14 years 10 months ago
2011
This paper proposes a new methodology to schedule activities in projects with stochastic activity durations. The main idea is to determine for each activity an interval in which th...
274
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
Views over probabilistic data contain correlations between tuples, and the current approach is to capture these correlations using explicit lineage. In this paper we propose an al...