Sciweavers

1502 search results - page 101 / 301
» Node weighted scheduling
Sort
View
JEC
2006
61views more  JEC 2006»
15 years 6 months ago
Time-constrained loop scheduling with minimal resources
Many applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). In our previous work, we proposed a ...
Timothy W. O'Neil, Edwin Hsing-Mean Sha
OSN
2011
14 years 9 months ago
A parallel iterative scheduler for asynchronous Optical Packet Switching networks
—This paper presents PI-OPS (Parallel-Iterative Optical Packet Scheduler) a parallel-iterative scheduler for asynchronous Optical Packet Switching nodes with optical buffering. O...
Pablo Pavón-Mariño, M. Victoria Buen...
INFOCOM
2002
IEEE
15 years 11 months ago
BSFQ: Bin Sort Fair Queueing
—Existing packet schedulers that provide fair sharing of an output link can be divided into two classes: sorted priority and frame-based. Sorted priority methods provide excellen...
Shun Yan Cheung, Corneliu S. Pencea
FOCS
1995
IEEE
15 years 9 months ago
Tracking the Best Disjunction
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...
Peter Auer, Manfred K. Warmuth
ICPR
2008
IEEE
16 years 7 months ago
A matrix alignment approach for link prediction
This paper introduces a new discriminative learning technique for link prediction based on the matrix alignment approach. Our algorithm automatically determines the most predictiv...
Jerry Scripps, Pang-Ning Tan, Feilong Chen, Abdol-...