Sciweavers

3367 search results - page 344 / 674
» Incremental assignment problem
Sort
View
INFOCOM
2005
IEEE
15 years 10 months ago
Optimizing cost-sensitive trust-negotiation protocols
Trust negotiation is a process that establishes mutual trust by the exchange of digital credentials and/or guiding policies among entities who may have no pre-existing knowledge a...
Weifeng Chen, L. Clarke, James F. Kurose, Donald F...
IWQOS
2004
Springer
15 years 10 months ago
Topology design for service overlay networks with bandwidth guarantees
— The Internet still lacks adequate support for QoS applications with real-time requirements. In great part, this is due to the fact that provisioning of end-to-end QoS to trafď¬...
S. L. Vieira, Jörg Liebeherr
SWAT
2004
Springer
136views Algorithms» more  SWAT 2004»
15 years 10 months ago
The Relative Worst Order Ratio Applied to Seat Reservation
The seat reservation problem is the problem of assigning passengers to seats on a train with n seats and k stations enroute in an online manner. The performance of algorithms for t...
Joan Boyar, Paul Medvedev
SODA
2003
ACM
125views Algorithms» more  SODA 2003»
15 years 6 months ago
Random MAX SAT, random MAX CUT, and their phase transitions
With random inputs, certain decision problems undergo a “phase transition”. We prove similar behavior in an optimization context. Given a conjunctive normal form (CNF) formula...
Don Coppersmith, David Gamarnik, Mohammad Taghi Ha...
CORR
2006
Springer
150views Education» more  CORR 2006»
15 years 4 months ago
The approximability of MAX CSP with fixed-value constraints
In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to ...
Vladimir G. Deineko, Peter Jonsson, Mikael Klasson...