3433 search results - page 95 / 687 » Heuristics for a bidding problem |
COMPSAC
2004
IEEE
14 years 1 months ago
2004
IEEE
While meta-heuristics are effective for solving large-scale combinatorial optimization problems, they result from time-consuming trial-and-error algorithm design tailored to speci...
FLAIRS
2007
14 years 13 days ago
2007
Currently, among the fastest approaches to AI task planning we find many forward-chaining heuristic planners, as FF. Most of their good performance comes from the use of domain-i...
SARA
2000
Springer
14 years 1 months ago
2000
Springer
In the past several years, significant progress has been made in finding optimal solutions to combinatorial problems. In particular, random instances of both Rubik's Cube, wi...
IPL
2002
13 years 9 months ago
2002
The barycenter heuristic is often used to solve the NP-hard two-layer edge crossing minimization problem. It is well-known that the barycenter heuristic can give solutions as bad a...
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
This paper presents a novel evolutionary approach to solve numerical optimization problems, called Adaptive Evolution (AEv). AEv is a new micro-population-like technique because i...