1274 search results - page 137 / 255 » N-fold integer programming |
ASPDAC
2004
ACM
14 years 3 months ago
2004
ACM
Many important tasks in circuit design and verification can be performed in practice via reductions to Boolean Satisfiability (SAT), making SAT a fundamental EDA problem. However ...
FPL
2004
Springer
14 years 3 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 ...
ICCS
2004
Springer
14 years 3 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...
PAKDD
2004
ACM
14 years 3 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...
HICSS
2003
IEEE
14 years 3 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...