4266 search results - page 208 / 854 » The container loading problem |
132
click to vote
JCO
2006
15 years 4 months ago
2006
A k-decomposition of a tree is a process in which the tree is recursively partitioned into k edge-disjoint subtrees until each subtree contains only one edge. We investigated the p...
129
Voted
JCT
2006
15 years 4 months ago
2006
MacLane's planarity criterion states that a finite graph is planar if and only if its cycle space has a basis B such that every edge is contained in at most two members of B....
125
click to vote
ORL
2006
15 years 4 months ago
2006
In this paper we derive estimates of the sample sizes required to solve a multistage stochastic programming problem with a given accuracy by the (conditional sampling) sample aver...
135
Voted
COMBINATORICS
2004
15 years 4 months ago
2004
Erdos posed the problem of how many random subsets need to be chosen from a set of n elements, each element appearing in each subset with probability p = 1/2, in order that at lea...
125
click to vote
MMAS
2010
Springer
14 years 11 months ago
2010
Springer
This article is devoted to the asymptotic analysis of the electromagnetic fields scattered by a perfectly conducting plane containing two sub-wavelength rectangular cavities. The p...