1723 search results - page 283 / 345 » Cycling in linear programming problems |
115
click to vote
AAAI
2010
14 years 11 months ago
2010
Dimensionality reduction is the process by which a set of data points in a higher dimensional space are mapped to a lower dimension while maintaining certain properties of these p...
NIPS
2008
14 years 11 months ago
2008
We consider the problem of multiple kernel learning (MKL), which can be formulated as a convex-concave problem. In the past, two efficient methods, i.e., Semi-Infinite Linear Prog...
ICWN
2004
14 years 11 months ago
2004
A critical issue in the design of routing protocols for wireless sensor networks is the efficient utilization of resources such as scarce bandwidth and limited energy supply. Many ...
70
Voted
WSC
1998
14 years 11 months ago
1998
A method of modeling transportation-inventory systems is proposed in an attempt to flexibly describe the systems in which a lot of kinds of items are ordered to transport, transpo...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
A well studied special case of bin packing is the 3-partition problem, where n items of size > 1 4 have to be packed in a minimum number of bins of capacity one. The famous Kar...