Sciweavers

13214 search results - page 358 / 2643
» Pseudorandomness for network algorithms
Sort
View
JAIR
2006
74views more  JAIR 2006»
15 years 6 months ago
Understanding Algorithm Performance on an Oversubscribed Scheduling Application
The best performing algorithms for a particular oversubscribed scheduling application, Air Force Satellite Control Network (AFSCN) scheduling, appear to have little in common. Yet...
Laura Barbulescu, Adele E. Howe, L. Darrell Whitle...
WWW
2008
ACM
16 years 7 months ago
Offline matching approximation algorithms in exchange markets
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
Zeinab Abbassi, Laks V. S. Lakshmanan
ICNP
1999
IEEE
15 years 11 months ago
Dynamic Memory Model Based Framework for Optimization of IP Address Lookup Algorithms
The design of software-based algorithms for fast IP address lookup targeted for general purpose processors has received tremendous attention in recent years due to its low cost im...
Gene Cheung, Steven McCanne
ICCAD
1994
IEEE
91views Hardware» more  ICCAD 1994»
15 years 11 months ago
A loosely coupled parallel algorithm for standard cell placement
We present a loosely coupled parallel algorithm for the placement of standard cell integrated circuits. Our algorithm is a derivative of simulated annealing. The implementation of...
Wern-Jieh Sun, Carl Sechen
TIT
2008
103views more  TIT 2008»
15 years 6 months ago
Fast Distributed Algorithms for Computing Separable Functions
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
Damon Mosk-Aoyama, Devavrat Shah