3208 search results - page 230 / 642 » A Lower Bound for Primality |
166
click to vote
ICALP
2004
Springer
15 years 12 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
178
click to vote
WG
1998
Springer
15 years 10 months ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
177
click to vote
JSAC
2006
15 years 6 months ago
2006
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
148
click to vote
MMS
1998
15 years 6 months ago
1998
In packet audio applications, packets are buffered at a receiving site and their playout delayed in order to compensate for variable network delays. In this paper, we consider the ...
160
Voted
RANDOM
2001
Springer
15 years 11 months ago
2001
Springer
d Abstract) Noga Alon1, , Michael Capalbo2, , Yoshiharu Kohayakawa3, , Vojtˇech R¨odl4,† , Andrzej Ruci´nski5,‡ , and Endre Szemer´edi6,§ 1 Department of Mathematics, Raym...