Sciweavers

2944 search results - page 77 / 589
» Improving Bound Propagation
Sort
View
AIPS
2006
13 years 11 months ago
Exploiting the Power of Local Search in a Branch and Bound Algorithm for Job Shop Scheduling
This paper presents three techniques for using an iterated local search algorithm to improve the performance of a state-of-the-art branch and bound algorithm for job shop scheduli...
Matthew J. Streeter, Stephen F. Smith
MONET
2011
13 years 5 months ago
Mathematical Analysis of Throughput Bounds in Random Access with ZigZag Decoding
— We investigate the throughput improvement that ZIGZAG decoding (Gollakota and Katabi (2008)) can achieve in multi-user random access systems. ZIGZAG is a recently proposed 802....
Jeongyeup Paek, Michael J. Neely
FOCS
2006
IEEE
14 years 4 months ago
Higher Lower Bounds for Near-Neighbor and Further Rich Problems
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
Mihai Patrascu, Mikkel Thorup
CORR
2006
Springer
160views Education» more  CORR 2006»
13 years 10 months ago
Frugality ratios and improved truthful mechanisms for vertex cover
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
ISI
2006
Springer
13 years 10 months ago
Distributing the Cost of Securing a Transportation Infrastructure
We address the problem of fairly distributing the cost of system-wide improvements to the security of a transportation infrastructure over the beneficiaries. We present a framework...
Sudarshan S. Chawathe