2095 search results - page 411 / 419 » Improved pebbling bounds |
CORR
2007
Springer
14 years 11 months ago
2007
Springer
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...
107
click to vote
CORR
2007
Springer
14 years 11 months ago
2007
Springer
— Franceschetti et al. [1] have recently shown that per-node throughput in an extended (i.e., geographically expanding), ad hoc wireless network with Θ(n) randomly distributed n...
EJC
2007
14 years 11 months ago
2007
Jim Propp’s P-machine, also known as the ‘rotor router model’ is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to ran...
132
click to vote
EOR
2007
14 years 11 months ago
2007
The two-dimensional orthogonal non-guillotine cutting problem (NGCP) appears in many industries (like wood and steel industries) and consists in cutting a rectangular master surfa...
ALGORITHMICA
2005
14 years 11 months ago
2005
The current standard for intra-domain network routing, Open Shortest Path First (OSPF), suffers from a number of problems--the tunable parameters (the weights) are hard to optimiz...