14548 search results - page 314 / 2910 » The Optimal Path-Matching Problem |
172
click to vote
ECAI
2010
Springer
15 years 7 months ago
2010
Springer
This paper proposes several operational approaches for solving fair allocation problems in the context of multiagent optimization. These problems arise in various contexts such as ...
170
click to vote
ICNC
2009
Springer
16 years 1 months ago
2009
Springer
—Genetic algorithm (GA) is too dependent on the initial population and a lack of local search ability. In this paper, an improved greedy genetic algorithm (IGAA) is proposed to o...
187
click to vote
GECCO
2007
Springer
16 years 24 days ago
2007
Springer
The Unit Commitment Problem (UCP) is the task of finding an optimal turn on and turn off schedule for a group of power generation units over a given time horizon to minimize ope...
161
click to vote
WADS
2007
Springer
16 years 23 days ago
2007
Springer
In this paper, we give a O(log copt)-approximation algorithm for the point guard problem where copt is the optimal number of guards. Our algorithm runs in time polynomial in n, the...
169
click to vote
ISLPED
2003
ACM
15 years 12 months ago
2003
ACM
This paper proposes two very fast graph theoretic heuristics for the low power binding problem given fixed number of resources and multiple architectures for the resources. First...