4860 search results - page 60 / 972 » SNPs Problems, Complexity, and Algorithms |
180
click to vote
GECCO
2005
Springer
16 years 2 days ago
2005
Springer
Because of the large number of possible combinations for the fuel assembly loading in the core, the design of the loading pattern (LP) is a complex optimization problem. It requir...
142
click to vote
COCO
1989
Springer
15 years 10 months ago
1989
Springer
For a monoid G, the iterated multiplication problem is the computation of the product of n elements from G. By re ning known completeness arguments, we show that as G varies over ...
133
click to vote
ICTAI
2005
IEEE
16 years 4 days ago
2005
IEEE
In this paper, a combinatorial auction problem is modeled as a NP-complete set packing problem and a Lagrangian relaxation based heuristic algorithm is proposed. Extensive experim...
171
click to vote
ICALP
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
161
click to vote
CEC
2005
IEEE
15 years 8 months ago
2005
IEEE
Abstract- The main purpose of this work is to measure the effect of bargaining players’ information completeness on agreements in evolutionary environments. We apply Co-evolution...