9119 search results - page 300 / 1824 » A Simultaneous Search Problem |
152
click to vote
SAC
2009
ACM
16 years 1 months ago
2009
ACM
The molecular distance geometry problem can be formulated as the problem of finding an immersion in R3 of a given undirected, nonnegatively weighted graph G. In this paper, we di...
175
click to vote
SARA
2009
Springer
16 years 1 months ago
2009
Springer
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
170
click to vote
CEC
2007
IEEE
16 years 1 months ago
2007
IEEE
— For complex optimization problems, several population-based heuristics like Multi-Objective Evolutionary Algorithms have been developed. These algorithms are aiming to deliver ...
142
click to vote
ISICA
2007
Springer
16 years 24 days ago
2007
Springer
In this paper the authors point out that the Pareto Optimality is unfair, unreasonable and imperfect for Many-objective Optimization Problems (MOPs) underlying the hypothesis that ...
125
click to vote
AUSAI
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. We present a Lagrangian-based heuristic LAHA for the Winner Determination Problem in Combinatorial Auctions. The algorithm makes use of the market computing power by appl...