1647 search results - page 227 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
118
Voted
ICCD
2000
IEEE
15 years 6 months ago
2000
IEEE
This paper presents a verification technique for functional comparison of large combinational circuits using a novel combination of known approaches. The idea is based on a tight...
124
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...
COLT
2008
Springer
15 years 4 months ago
2008
Springer
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...
124
click to vote
ADHOCNETS
2009
Springer
15 years 6 days ago
2009
Springer
This paper presents a header compression algorithm that unlike previous protocols is capable of compressing MAC headers in a multiple-access (shared) channel. Previous schemes coul...
116
click to vote
SPAA
2004
ACM
15 years 7 months ago
2004
ACM
This paper considers the problem of packet-mode scheduling of input queuedswitches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives t...