Sciweavers

3320 search results - page 168 / 664
» Heuristics for the Phylogeny Problem
Sort
View
WAE
2000
103views Algorithms» more  WAE 2000»
15 years 8 months ago
Lattice Basis Reduction with Dynamic Approximation
Abstract. In this paper we present a heuristic based on dynamic approximations for improving the well-known Schnorr-Euchner lattice basis reduction algorithm. In particular, the ne...
Werner Backes, Susanne Wetzel
AAAI
1994
15 years 8 months ago
In Search of the Best Constraint Satisfaction Search
We present the results of an empirical study of several constraint satisfaction search algorithms and heuristics. Using a random problem generator that allows us to create instanc...
Daniel Frost, Rina Dechter
WEA
2005
Springer
93views Algorithms» more  WEA 2005»
16 years 2 days ago
From Static Code Distribution to More Shrinkage for the Multiterminal Cut
We present the problem of statically distributing instructions of a common programming language, a problem which we prove equivalent to the multiterminal cut problem. We design eï¬...
Bram De Wachter, Alexandre Genon, Thierry Massart
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...