18306 search results - page 507 / 3662 » Algorithmics in Exponential Time |
210
click to vote
FSTTCS
2010
Springer
15 years 5 months ago
2010
Springer
We consider the following fundamental scheduling problem. The input consists of n jobs to be scheduled on a set of machines of bounded capacities. Each job is associated with a re...
168
click to vote
ISAAC
1994
Springer
15 years 11 months ago
1994
Springer
In this paper we present efficient deterministic and randomized algorithms for selection on any interconnection network when the number of input keys (n) is the number of processo...
187
click to vote
ICCAD
2006
IEEE
16 years 4 months ago
2006
IEEE
In this paper, we propose the first wire density driven global routing that considers CMP variation and timing. To enable CMP awareness during global routing, we propose a compac...
188
click to vote
ICRA
2008
IEEE
16 years 2 months ago
2008
IEEE
— This paper focuses on the assignment of discrete points to two robots, in the presence of geometric and kinematic constraints between the robots. The individual points have dif...
207
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
The duration of time for which each application locks each shared resource is critically important in composing multiple independently-developed applications upon a shared “open...