519 search results - page 50 / 104 » A New Approach to Strongly Polynomial Linear Programming |
ICALP
2005
Springer
15 years 7 months ago
2005
Springer
Abstract: The quantum adversary method is one of the most versatile lower-bound methods for quantum algorithms. We show that all known variants of this method are equivalent: spect...
121
click to vote
JALC
2006
15 years 1 months ago
2006
Automated Web Service Composition has gained a significant momentum in facilitating fast and efficient formation of business-to-business collaborations where an important objectiv...
126
click to vote
POS
1994
Springer
15 years 5 months ago
1994
Springer
We consider some issues in optimizing persistent programming languages. In particular, we show how to express optimizations of object residency checks in strongly typed persistent...
109
click to vote
PLDI
2003
ACM
15 years 6 months ago
2003
ACM
We compile Nova, a new language designed for writing network processing applications, using a back end based on integer-linear programming (ILP) for register allocation, optimal b...
119
click to vote
APVIS
2008
15 years 2 months ago
2008
In the field of Volume Rendering, pre-integration techniques for arbitrary transfer functions has certainly led to the most significant and convincing results both quality and per...