Sciweavers

3221 search results - page 441 / 645
» Termination of Linear Programs
Sort
View
ICCS
2004
Springer
15 years 11 months ago
Routing and Wavelength Assignments in Optical WDM Networks with Maximum Quantity of Edge Disjoint Paths
In the present paper routing and wavelength assignment (RWA) in optical WDM networks is discussed. Previous techniques on based on the integer linear programming and graph coloring...
Hyunseung Choo, Vladimir V. Shakhov
IFIP
2004
Springer
15 years 11 months ago
On Complexity of Model-Checking for the TQL Logic
In this paper we study the complexity of the model-checking problem for the tree logic introduced as the basis for the query language TQL [Cardelli and Ghelli, 2001]. We define tw...
Iovka Boneva, Jean-Marc Talbot
PVM
2004
Springer
15 years 11 months ago
A Refinement Strategy for a User-Oriented Performance Analysis
We introduce a refinement strategy to bring the parallel performance analysis closer to the user. The analysis starts with a simple high-level performance model. It is based on fir...
Jan Lemeire, Andy Crijns, John Crijns, Erik F. Dir...
SPIN
2004
Springer
15 years 11 months ago
Minimization of Counterexamples in SPIN
We propose an algorithm to find a counterexample to some property in a finite state program. This algorithm is derived from SPIN’s one, but it finds a counterexample faster th...
Paul Gastin, Pierre Moro, Marc Zeitoun
ISLPED
2003
ACM
96views Hardware» more  ISLPED 2003»
15 years 11 months ago
Effective graph theoretic techniques for the generalized low power binding problem
This paper proposes two very fast graph theoretic heuristics for the low power binding problem given fixed number of resources and multiple architectures for the resources. First...
Azadeh Davoodi, Ankur Srivastava