2095 search results - page 245 / 419 » Improved pebbling bounds |
229
click to vote
TAINN
2005
Springer
16 years 5 days ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
158
click to vote
ASPDAC
2004
ACM
16 years 3 days ago
2004
ACM
Abstract—The dynamic power consumed by a digital CMOS circuit is directly proportional to capacitance. In this paper, we consider pre-routing capacitance estimation for FPGAs and...
176
click to vote
ISAAC
2004
Springer
16 years 1 days ago
2004
Springer
Abstract. We study the problem of maintaining a (1+ )-factor approximation of the diameter of a stream of points under the sliding window model. In one dimension, we give a simple ...
154
click to vote
SWAT
2004
Springer
16 years 1 days ago
2004
Springer
We consider online scheduling of splittable tasks on parallel machines. In our model, each task can be split into a limited number of parts, that can then be scheduled independentl...
184
Voted
WAOA
2004
Springer
16 years 1 days ago
2004
Springer
We consider a non-preemptive, stochastic parallel machine scheduling model with the goal to minimize the weighted completion times of jobs. In contrast to the classical stochastic ...