Sciweavers

3319 search results - page 499 / 664
» Type Theoretical Databases
Sort
View
FOCS
2005
IEEE
15 years 10 months ago
On Non-Approximability for Quadratic Programs
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler...
FOCS
2005
IEEE
15 years 10 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
158
Voted
INFOCOM
2005
IEEE
15 years 10 months ago
Credit based fair scheduling for packet switched networks
With the rapid development of Internet multimedia applications, the next generation of networks is required to schedule not only the best effort traffic but also the traffic wit...
Deng Pan, Yuanyuan Yang
RTA
2005
Springer
15 years 10 months ago
Arithmetic as a Theory Modulo
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the st...
Gilles Dowek, Benjamin Werner
140
Voted
SPIN
2005
Springer
15 years 10 months ago
Behavioural Models for Hierarchical Components
We describe a method for the specification and verification of the dynamic behaviour of component systems. Building applications using a component framework allows the developers...
Tomás Barros, Ludovic Henrio, Eric Madelain...