Sciweavers

1033 search results - page 63 / 207
» The Relative History Heuristic
Sort
View
TREC
2004
15 years 1 months ago
The University of Michigan in Novelty 2004
This year we participated in the Novelty track. To find the relevant sentences, we combine sentence salience features that are inherited from text summarization domain with other ...
Günes Erkan
DISOPT
2006
90views more  DISOPT 2006»
14 years 12 months ago
Tree decompositions of graphs: Saving memory in dynamic programming
We propose an effective heuristic to save memory in dynamic programming on tree decompositions when solving graph optimization problems. The introduced "anchor technique"...
Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann
EOR
2007
93views more  EOR 2007»
14 years 11 months ago
Location-routing: Issues, models and methods
This paper is a survey of location-routing: a relatively new branch of locational analysis that takes into account vehicle routing aspects. We propose a classification scheme and...
Gábor Nagy, Saïd Salhi
DAC
1999
ACM
16 years 25 days ago
Hypergraph Partitioning with Fixed Vertices
We empirically assess the implications of fixed terminals for hypergraph partitioning heuristics. Our experimental testbed incorporates a leading-edge multilevel hypergraph partit...
Andrew E. Caldwell, Andrew B. Kahng, Igor L. Marko...
ICMT
2009
Springer
15 years 6 months ago
Pattern-Based Model-to-Model Transformation: Handling Attribute Conditions
Abstract. Pattern-based model-to-model transformation is a new approach for specifying transformations in a declarative, relational and formal style. The language relies on pattern...
Esther Guerra, Juan de Lara, Fernando Orejas