2531 search results - page 125 / 507 » Group testing in graphs |
68
Voted
ENTCS
2007
15 years 24 days ago
2007
In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to...
80
Voted
ANTS
2004
Springer
15 years 6 months ago
2004
Springer
Given an algebraic number field K, such that [K : Q] is constant, we show that the problem of computing the units group O∗ K is in the complexity class SPP. As a consequence, w...
115
Voted
DLOG
2007
15 years 3 months ago
2007
Abstract. The DL implementation group (DIG) has specified a common interface for description logic reasoner. While the original intention was to make it easier for other tools to ...
136
Voted
IOR
2011
14 years 7 months ago
2011
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...
80
Voted
GECCO
2009
Springer
15 years 5 months ago
2009
Springer
The generalized generation gap (G3) model of an evolutionary algorithm equipped with the parent centric crossover (PCX) is tested on the BBOB 2009 benchmark testbed. To improve it...