Sciweavers

1291 search results - page 50 / 259
» Arithmetic program paths
Sort
View
ICALP
1995
Springer
14 years 1 days ago
Shortest Path Queries in Digraphs of Small Treewidth
We consider the problem of preprocessing an n-vertex digraph with real edge weights so that subsequent queries for the shortest path or distance between any two vertices can be efï...
Shiva Chaudhuri, Christos D. Zaroliagis
SC
1992
ACM
14 years 16 days ago
Parallel Program Performance Metrics: A Comparison and Validation
There are many metrics designed to assist in the performance debugging of large-scale parallel applications. We describe a new technique, called True Zeroing, that permits direct ...
Jeffrey K. Hollingsworth, Barton P. Miller
CP
1999
Springer
14 years 23 days ago
A Framework for Constraint Programming Based Column Generation
Column generation is a state-of-the-art method for optimally solving di cult large-scale optimization problems such as airline crew assignment. We show how to apply column generati...
Ulrich Junker, Stefan E. Karisch, Niklas Kohl, Bo ...
SEUS
2009
IEEE
14 years 3 months ago
A Single-Path Chip-Multiprocessor System
Abstract. In this paper we explore the combination of a time-predictable chipmultiprocessor system with the single-path programming paradigm. Time-sliced arbitration of the main me...
Martin Schoeberl, Peter P. Puschner, Raimund Kirne...
COR
2010
108views more  COR 2010»
13 years 8 months ago
GRASP and path relinking for the max-min diversity problem
The Max-Min Diversity Problem (MMDP) consists in selecting a subset of elements from a given set in such a way that the diversity among the selected elements is maximized. The prob...
Mauricio G. C. Resende, Rafael Martí, Micae...