4266 search results - page 709 / 854 » The container loading problem |
JCT
2007
13 years 7 months ago
2007
For an r-graph H, let C(H) = minS d(S), where the minimum is taken over all (r − 1)-sets of vertices of H, and d(S) is the number of vertices v such that S ∪ {v} is an edge of...
JGAA
2007
13 years 7 months ago
2007
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
TPLP
2008
13 years 7 months ago
2008
We present in this paper a first-order axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and ...
TSE
2008
13 years 7 months ago
2008
This paper presents a framework for security requirements elicitation and analysis. The framework is based on constructing a context for the system, representing security requireme...
JSAC
2007
13 years 7 months ago
2007
We explore the SNR-optimal relay functionality in a memoryless relay network, i.e. a network where, during each channel use, the signal transmitted by a relay depends only on the ...