850 search results - page 12 / 170 » heuristics 2006 |
IPL
2002
13 years 10 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...
JAIR
2006
13 years 11 months ago
2006
This paper presents a new framework for anytime heuristic search where the task is to achieve as many goals as possible within the allocated resources. We show the inadequacy of t...
HEURISTICS
2002
13 years 10 months ago
2002
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
AVI
2006
14 years 9 days ago
2006
Heuristic evaluation is a well known discount evaluation technique in HCI but has not been utilized in Information Visualization (InfoVis) to the same extent. While several sets o...
HEURISTICS
2007
13 years 10 months ago
2007
In this paper, we develop and discuss several distance measures for permutation type representations of solutions of combinatorial optimisation problems. The problems discussed in...