5624 search results - page 584 / 1125 » On Conditional Covering Problem |
189
click to vote
DSS
2006
15 years 7 months ago
2006
Workflow research is commonly concerned with optimization, modeling, and dependency. In this research, we however address a more fundamental issue. By modeling humans and machines...
171
click to vote
COMCOM
2007
15 years 7 months ago
2007
The difficulty of efficiently reordering the rules in an Access Control List is considered and the essential optimisation problem formulated. The complexity of exact and sophistic...
206
click to vote
IVC
2008
15 years 7 months ago
2008
In this work, we propose an original method of resolution of the shape from shading problem, which is accurate and converges with a few iterations. It relies on two simple ideas. ...
162
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
We consider the one-person game of peg solitaire on a triangular board of arbitrary size. The basic game begins from a full board with one peg missing and finishes with one peg a...
145
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
—We show an interesting pairwise balanced design (PBD)-closure result for the set of lengths of constant-composition codes whose distance and size meet certain conditions. A cons...