Sciweavers

2926 search results - page 341 / 586
» Partially Optimal Routing
Sort
View
145
Voted
INFOCOM
2003
IEEE
15 years 9 months ago
Network Management Information For Light-Path Assessment: Trade-off between Performance and Complexity
We investigate network management information for light-path assessment to dynamically set up end-to-end lightpaths across administrative domains. Our focus is on invetigating what...
Guanglei Liu, Chuanyi Ji, Vincent W. S. Chan
159
Voted
ICFP
1999
ACM
15 years 8 months ago
Specialization of Inductively Sequential Functional Logic Programs
Functional logic languages combine the operational principles of the most important declarative programming paradigms, namely functional and logic programming. Inductively sequent...
María Alpuente, Michael Hanus, Salvador Luc...
135
Voted
ICALP
1998
Springer
15 years 7 months ago
Efficient Approximation Algorithms for the Subset-Sums Equality Problem
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...
Cristina Bazgan, Miklos Santha, Zsolt Tuza
120
Voted
ATS
2005
IEEE
164views Hardware» more  ATS 2005»
15 years 5 months ago
A Family of Logical Fault Models for Reversible Circuits
Reversibility is of interest in achieving extremely low power dissipation; it is also an inherent design requirement of quantum computation. Logical fault models for conventional ...
Ilia Polian, Thomas Fiehn, Bernd Becker, John P. H...
NIPS
2007
15 years 5 months ago
On Ranking in Survival Analysis: Bounds on the Concordance Index
In this paper, we show that classical survival analysis involving censored data can naturally be cast as a ranking problem. The concordance index (CI), which quantifies the quali...
Vikas C. Raykar, Harald Steck, Balaji Krishnapuram...