146 search results - page 14 / 30 » Optimally Solving the MCM Problem Using Pseudo-Boolean Satis... |
96
Voted
GECCO
2008
Springer
15 years 23 days ago
2008
Springer
The transportation planning (TP) is well-known basic network problem. However, for some real-world applications, it is often that the TP model is extended to satisfy other additio...
105
click to vote
ATAL
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. The generalized assignment problem (GAP) is a typical NP-hard problem and has been studied for many years mainly in the operations research community. The goal of the GAP...
115
Voted
WEBI
2010
Springer
14 years 9 months ago
2010
Springer
High-dimensional data usually incur learning deficiencies and computational difficulties. We present a novel semi-supervised dimensionality reduction technique that embeds high-dim...
107
Voted
TCOM
2010
14 years 10 months ago
2010
Abstract—This paper studies a constrained optical signal-tonoise ratio (OSNR) optimization problem in optical networks from the perspective of system performance. A system optimi...
108
click to vote
ECAI
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. Scheduling meetings is generally difficult in that it attempts to satisfy the preferences of all participants. However, all participants can agree to a schedule in which...