Sciweavers

95 search results - page 19 / 19
» On the Approximability of the Maximum Interval Constrained C...
Sort
View
VLSISP
2002
112views more  VLSISP 2002»
13 years 6 months ago
Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow Networks
Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dat...
Ramaswamy Govindarajan, Guang R. Gao, Palash Desai
ALENEX
2008
180views Algorithms» more  ALENEX 2008»
13 years 7 months ago
Geometric Algorithms for Optimal Airspace Design and Air Traffic Controller Workload Balancing
The National Airspace System (NAS) is designed to accommodate a large number of flights over North America. For purposes of workload limitations for air traffic controllers, the a...
Amitabh Basu, Joseph S. B. Mitchell, Girishkumar S...
IJRR
2007
104views more  IJRR 2007»
13 years 6 months ago
Deep Space Formation Flying Spacecraft Path Planning
Efficient algorithms for collision-free energy sub-optimal path planning for formations of spacecraft flying in deep space are presented. The idea is to introduce a set of way-poi...
Cornel Sultan, Sanjeev Seereeram, Raman K. Mehra
KDD
2006
ACM
134views Data Mining» more  KDD 2006»
14 years 6 months ago
Learning to rank networked entities
Several algorithms have been proposed to learn to rank entities modeled as feature vectors, based on relevance feedback. However, these algorithms do not model network connections...
Alekh Agarwal, Soumen Chakrabarti, Sunny Aggarwal
SPAA
2004
ACM
13 years 11 months ago
On achieving optimized capacity utilization in application overlay networks with multiple competing sessions
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split...
Yi Cui, Baochun Li, Klara Nahrstedt