1632 search results - page 181 / 327 » On special numberings of hypergraphs |
161
click to vote
GECCO
2007
Springer
16 years 20 days ago
2007
Springer
Algorithms for the construction of software interaction test suites have focussed on the special case of pairwise coverage; less is known about efficiently constructing test suite...
165
click to vote
ISAAC
2007
Springer
16 years 19 days ago
2007
Springer
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
154
click to vote
KES
2007
Springer
16 years 19 days ago
2007
Springer
In spatial graphs with a vast number of nodes, it is difficult to compute a solution to graph optimisation problems. We propose an approach using meta-level agents for multi-agents...
152
click to vote
PEPM
2007
ACM
16 years 18 days ago
2007
ACM
A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This noti...
296
click to vote
SERA
2007
Springer
16 years 18 days ago
2007
Springer
Capacity planning is a technique which can be used to predict the computing resource needs of an organization for the future after studying current usage patterns. This is of spec...