Sciweavers

3433 search results - page 182 / 687
» Heuristics for a bidding problem
Sort
View
COR
2008
95views more  COR 2008»
15 years 6 months ago
Good triangulations yield good tours
Consider the following heuristic for planar Euclidean instances of the Traveling Salesman Problem (TSP): select a subset of the edges which induces a planar graph, and solve eithe...
Adam N. Letchford, Nicholas A. Pearson
EDBT
2012
ACM
247views Database» more  EDBT 2012»
13 years 9 months ago
Heuristics-based query optimisation for SPARQL
Query optimization in RDF Stores is a challenging problem as SPARQL queries typically contain many more joins than equivalent relational plans, and hence lead to a large join orde...
Petros Tsialiamanis, Lefteris Sidirourgos, Irini F...
EVOW
2009
Springer
16 years 1 months ago
Binary Exponential Back Off for Tabu Tenure in Hyperheuristics
In this paper we propose a new tabu search hyperheuristic which makes individual low level heuristics tabu dynamically using an analogy with the Binary Exponential Back Off (BEBO) ...
Stephen Remde, Keshav P. Dahal, Peter I. Cowling, ...
ECAI
2004
Springer
15 years 12 months ago
Postponing Branching Decisions
Abstract. Solution techniques for Constraint Satisfaction and Optimisation Problems often make use of backtrack search methods, exploiting variable and value ordering heuristics. I...
Willem Jan van Hoeve, Michela Milano
MSS
2003
IEEE
104views Hardware» more  MSS 2003»
15 years 12 months ago
Using Multiple Predictors to Improve the Accuracy of File Access Predictions
Existing file access predictors keep track of previous file access patterns and rely on a single heuristic to predict which of the previous successors to the file being currently ...
Gary A. S. Whittle, Jehan-François Pâ...