Sciweavers

725 search results - page 35 / 145
» heuristics 2010
Sort
View
ERCIMDL
2010
Springer
144views Education» more  ERCIMDL 2010»
13 years 11 months ago
Capacity-Constrained Query Formulation
Given a set of keyphrases, we analyze how Web queries with these phrases can be formed that, taken altogether, return a specified number of hits. The use case of this problem is a ...
Matthias Hagen, Benno Stein
IV
2010
IEEE
186views Visualization» more  IV 2010»
13 years 8 months ago
Visual Amortization Analysis of Recompilation Strategies
Abstract--Dynamic recompilation tries to produce more efficient code by exploiting runtime information. Virtual machines like the Jikes RVM use recompilation heuristics to decide h...
Stephan Zimmer, Stephan Diehl
CADE
2010
Springer
13 years 11 months ago
Decreasing Diagrams and Relative Termination
In this paper we use the decreasing diagrams technique to show that a left-linear term rewrite system R is confluent if all its critical pairs are joinable and the critical pair st...
Nao Hirokawa, Aart Middeldorp
GISCIENCE
2010
Springer
166views GIS» more  GISCIENCE 2010»
13 years 10 months ago
Periodic Multi-labeling of Public Transit Lines
We designed and implemented a simple and fast heuristic for placing multiple labels along edges of a planar network. As a testbed, realworld data from Google Transit is taken: our ...
Valentin Polishchuk, Arto Vihavainen
CORR
2010
Springer
156views Education» more  CORR 2010»
13 years 10 months ago
The Exact Closest String Problem as a Constraint Satisfaction Problem
We report (to our knowledge) the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration o...
Tom Kelsey, Lars Kotthoff