Sciweavers

16596 search results - page 103 / 3320
» Generalized Assignment Problems
Sort
View
AAIM
2005
Springer
122views Algorithms» more  AAIM 2005»
15 years 9 months ago
Complexity of Minimal Tree Routing and Coloring
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
Xujin Chen, Xiao-Dong Hu, Xiaohua Jia
RTS
2006
121views more  RTS 2006»
15 years 4 months ago
Group-Based Pfair Scheduling
We consider the problem of supertasking in Pfair-scheduled multiprocessor systems. In this approach, a set of tasks, called component tasks, is assigned to a server task, called a...
Philip Holman, James H. Anderson
TON
2010
171views more  TON 2010»
14 years 11 months ago
Offline Routing and Wavelength Assignment in Transparent WDM Networks
We consider the offline version of the routing and wavelength assignment (RWA) problem in transparent all-optical networks. In such networks and in the absence of regenerators, the...
Konstantinos Christodoulopoulos, Konstantinos Mano...
NIPS
1993
15 years 5 months ago
Credit Assignment through Time: Alternatives to Backpropagation
Learning to recognize or predict sequences using long-term context has many applications. However, practical and theoretical problems are found in training recurrent neural networ...
Yoshua Bengio, Paolo Frasconi
CIKM
2009
Springer
15 years 10 months ago
Packing the most onto your cloud
Parallel dataflow programming frameworks such as Map-Reduce are increasingly being used for large scale data analysis on computing clouds. It is therefore becoming important to a...
Ashraf Aboulnaga, Ziyu Wang, Zi Ye Zhang