2976 search results - page 304 / 596 » On the bounded integer programming |
118
click to vote
FPL
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. This paper focuses on a class of problem relating to the multiplication of a single number by several coefficients that, while not constant, are drawn from a finite set ...
169
Voted
ICCS
2004
Springer
15 years 10 months ago
2004
Springer
In the present paper routing and wavelength assignment (RWA) in optical WDM networks is discussed. Previous techniques on based on the integer linear programming and graph coloring...
134
click to vote
PAKDD
2004
ACM
15 years 10 months ago
2004
ACM
The use of unlabeled data to aid classification is important as labeled data is often available in limited quantity. Instead of utilizing training samples directly into semi-super...
115
click to vote
HICSS
2003
IEEE
15 years 10 months ago
2003
IEEE
The hop constrained min-sum arborescence with outage costs problem consists of selecting links in a network so as to connect a set of terminal nodes N={2,3,……n} to a central n...
138
click to vote
ISLPED
2003
ACM
15 years 10 months ago
2003
ACM
This paper proposes two very fast graph theoretic heuristics for the low power binding problem given fixed number of resources and multiple architectures for the resources. First...