1502 search results - page 56 / 301 » Node weighted scheduling |
178
click to vote
IJON
2007
15 years 5 months ago
2007
Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden n...
157
click to vote
ICALP
2010
Springer
15 years 10 months ago
2010
Springer
Assuming the Unique Games Conjecture (UGC), we show optimal inapproximability results for two classic scheduling problems. We obtain a hardness of 2 − ε for the problem of mini...
168
Voted
FPL
2000
Springer
15 years 9 months ago
2000
Springer
Message sequencing and channel assignment are two important aspects to consider in optimizing the performance of Wavelength Division Multiplexing (WDM) networks. A scheduling techn...
155
click to vote
SISAP
2008
IEEE
15 years 12 months ago
2008
IEEE
In this article, we review the major paradigms for approximate similarity queries and propose a classification schema that easily allows existing approaches to be compared along ...
147
click to vote
ICCAD
1994
IEEE
15 years 9 months ago
1994
IEEE
In high level synthesis each node of a synchronous dataflow graph (DFG) is scheduled to a specific time and allocated to a processor. In this paper we present new integer linear p...