697 search results - page 59 / 140 » Improving EAs for Sequencing Problems |
AAAI
2004
13 years 10 months ago
2004
A memory-based heuristic is a heuristic function that is stored in a lookup table. Very accurate heuristics have been created by building very large lookup tables, sometimes calle...
TOG
2012
11 years 11 months ago
2012
We present a method for recovering a temporally coherent, deforming triangle mesh with arbitrarily changing topology from an incoherent sequence of static closed surfaces. We solv...
AAAI
2006
13 years 10 months ago
2006
Coordinating multiple agents that need to perform a sequence of actions to maximize a system level reward requires solving two distinct credit assignment problems. First, credit m...
STOC
2004
ACM
14 years 9 months ago
2004
ACM
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...
DNA
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. The goal of this research is to improve the programmability of DNA-based computers. Novel clockable microreactors can be connected in various ways to solve combinatorial ...