4266 search results - page 235 / 854 » The container loading problem |
132
click to vote
DM
2010
15 years 4 months ago
2010
Given a polygon P in the plane, a pop operation is the reflection of a vertex with respect to the line through its adjacent vertices. We define a family of alternating polygons, a...
124
click to vote
ENTCS
2008
15 years 4 months ago
2008
Using linear algebraic techniques, we analyse the computational complexity of testing reachability in Petri nets for which markings can grow very fast. This leads to two subclasse...
129
click to vote
DAM
2006
15 years 4 months ago
2006
Abstract. In this paper we present an algorithm for the problem of exhaustive equivalence-free generation of 3-connected matroids which are represented by a matrix over some finite...
113
click to vote
JCSS
2008
15 years 4 months ago
2008
We give a quadratic algorithm for the following structure identification problem: given a Boolean relation R and a finite set S of Boolean relations, can the relation R be express...
131
click to vote
JCT
2008
15 years 4 months ago
2008
If a Steiner system S(4, 5, 17) exists, it would contain derived S(3, 4, 16) designs. By relying on a recent classification of the S(3, 4, 16), an exhaustive computer search for S...