350 search results - page 50 / 70 » Lower bounds and heuristic algorithms for the k |
SPAA
2005
ACM
15 years 3 months ago
2005
ACM
Switching cells in parallel is a common approach to build switches with very high external line rate and a large number of ports. A prime example is the parallel packet switch (in...
AAAI
2010
14 years 11 months ago
2010
We consider approval voting elections in which each voter votes for a (possibly empty) set of candidates and the outcome consists of a set of k candidates for some parameter k, e....
STOC
1993
ACM
15 years 1 months ago
1993
ACM
We analyze algorithms that predict a binary value by combining the predictions of several prediction strategies, called experts. Our analysis is for worst-case situations, i.e., we...
114
click to vote
COLT
2010
Springer
14 years 7 months ago
2010
Springer
We describe online algorithms for learning a rotation from pairs of unit vectors in Rn . We show that the expected regret of our online algorithm compared to the best fixed rotati...
78
Voted
DATE
2009
IEEE
15 years 4 months ago
2009
IEEE
—Today, many chips are designed with predefined discrete cell libraries. In this paper we present a new fast gate sizing algorithm that works natively with discrete cell choices...