Sciweavers

983 search results - page 18 / 197
» Negative-Weight Cycle Algorithms
Sort
View
JACM
2006
98views more  JACM 2006»
14 years 11 months ago
Distribution sort with randomized cycling
Parallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often di cult. In this paper we develop randomized variants ...
Jeffrey Scott Vitter, David A. Hutchinson
IACR
2011
112views more  IACR 2011»
13 years 11 months ago
Improved Generic Algorithms for Hard Knapsacks
At Eurocrypt 2010, Howgrave-Graham and Joux described an algorithm for solving hard knapsacks of density close to 1 in time ˜O(20.337n ) and memory ˜O(20.256n ), thereby improvin...
Anja Becker, Jean-Sébastien Coron, Antoine ...
SAT
2009
Springer
95views Hardware» more  SAT 2009»
15 years 6 months ago
Finding Lean Induced Cycles in Binary Hypercubes
Induced (chord-free) cycles in binary hypercubes have many applications in computer science. The state of the art for computing such cycles relies on genetic algorithms, which are,...
Yury Chebiryak, Thomas Wahl, Daniel Kroening, Leop...
TON
2010
118views more  TON 2010»
14 years 10 months ago
ILP formulations for p-cycle design without candidate cycle enumeration
—The concept of p-cycle (preconfigured protection cycle) allows fast and efficient span protection in wavelength division multiplexing (WDM) mesh networks. To design p-cycles f...
Bin Wu, Kwan L. Yeung, Pin-Han Ho
PODC
1997
ACM
15 years 3 months ago
Collecting Distributed Garbage Cycles by Back Tracing
Systems that store objects at a large number of sites require fault-tolerant and timely garbage collection. A popular technique is to trace each site independently using inter-sit...
Umesh Maheshwari, Barbara Liskov