15375 search results - page 33 / 3075 » cans 2008 |
DM
2008
13 years 7 months ago
2008
A covering array CA(N; t, k, v) is an N
SIAMCOMP
2008
13 years 7 months ago
2008
We show that the treewidth and the minimum fill-in of an n-vertex graph can be
DM
2006
13 years 7 months ago
2006
The simple device of maximization over subsets of events can provide substantial improvement over the Dawson
DM
2006
13 years 7 months ago
2006
We explain some analytic methods that can be useful in solving Hex puzzles.
CGF
2002
13 years 7 months ago
2002
Many graphical objects can be represented by swept volumes (including its subset