1927 search results - page 278 / 386 » UMDAs for dynamic optimization problems |
EOR
2008
15 years 25 days ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
113
click to vote
HEURISTICS
2008
15 years 25 days ago
2008
In this article we investigate a new variant of Variable Neighborhood Search (VNS): Relaxation Guided Variable Neighborhood Search. It is based on the general VNS scheme and a new...
CORR
2006
Springer
15 years 24 days ago
2006
Springer
The aim of the paper is to introduce general techniques in order to optimize the parallel execution time of sorting on a distributed architectures with processors of various speeds...
104
Voted
MANSCI
2006
15 years 21 days ago
2006
The problem of group ranking, a.k.a. rank aggregation, has been studied in contexts varying from sports, to multi-criteria decision making, to machine learning, to ranking web pag...
120
Voted
ICTAI
2005
IEEE
15 years 6 months ago
2005
IEEE
In this paper, we study strategies in incremental planning for ordering and grouping subproblems partitioned by the subgoals of a planning problem when each subproblem is solved b...