4266 search results - page 407 / 854 » The container loading problem |
201
click to vote
ENDM
2008
15 years 6 months ago
2008
In this paper we study some connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) ...
173
click to vote
AUTOMATICA
2006
15 years 6 months ago
2006
System identification of plants with binary-valued output observations is of importance in understanding modeling capability and limitations for systems with limited sensor inform...
183
click to vote
EOR
2006
15 years 6 months ago
2006
In Gal and Hanne [Eur. J. Oper. Res. 119 (1999) 373] the problem of using several methods to solve a multiple criteria decision making (MCDM) problem with linear objective functio...
178
click to vote
COMBINATORICS
2007
15 years 6 months ago
2007
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
192
click to vote
JMLR
2008
15 years 6 months ago
2008
We show that the relevant information of a supervised learning problem is contained up to negligible error in a finite number of leading kernel PCA components if the kernel matche...