3433 search results - page 131 / 687 » Heuristics for a bidding problem |
168
click to vote
JUCS
2010
15 years 5 months ago
2010
: Given a multiple power sum (extending polynomial’s exponents to real numbers), the positive root isolation problem is to find a list of disjoint intervals, satisfying that the...
140
click to vote
ICGA
1997
15 years 7 months ago
1997
This paper introduces the wave model, a novel approach on analyzing the behavior of GAs. Our aim is to give techniques that have practical relevance and provide tools for improvin...
150
click to vote
ACISICIS
2007
IEEE
16 years 26 days ago
2007
IEEE
This paper addresses the problem of finding a feasible solution for the University Course Timetabling Problem (UCTP), i.e. a solution that satisfies all the so-called hard const...
153
click to vote
GECCO
2007
Springer
16 years 20 days ago
2007
Springer
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
166
click to vote
HICSS
2005
IEEE
16 years 3 days ago
2005
IEEE
In this paper we formulate a combinatorial auction brokering problem as a set packing problem and apply a simulated annealing heuristic with hybrid local moves to solve the proble...