8413 search results - page 223 / 1683 » Ordering Problem Subgoals |
100
click to vote
FCT
2005
Springer
15 years 6 months ago
2005
Springer
Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number or total size of accepted items. ...
120
Voted
TAMC
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...
111
click to vote
CCR
2005
15 years 20 days ago
2005
There exist a wide variety of network design problems that require a traffic matrix as input in order to carry out performance evaluation. The research community has not had at it...
106
Voted
FOCS
2010
IEEE
14 years 10 months ago
2010
IEEE
The Coin Problem is the following problem: a coin is given, which lands on head with probability either 1/2 + or 1/2 - . We are given the outcome of n independent tosses of this co...
101
click to vote
ICCAD
2001
IEEE
15 years 9 months ago
2001
IEEE
Timing closure problems occur when timing estimates computed during logic synthesis do not match with timing estimates computed from the layout of the circuit. In such a situation...