817 search results - page 33 / 164 » On 2-factors with k components |
157
click to vote
FPL
2004
Springer
15 years 11 months ago
2004
Springer
—This paper presents a methodology and a tool for automatic synthesis of highly efficient intrusion detection systems using a high-level, graph-based partitioning methodology and...
151
click to vote
IWPEC
2004
Springer
15 years 11 months ago
2004
Springer
We consider parameterized problems where some separation property has to be achieved by deleting as few vertices as possible. The following five problems are studied: delete k ve...
178
click to vote
ICALP
1992
Springer
15 years 10 months ago
1992
Springer
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
172
click to vote
APIN
2004
15 years 6 months ago
2004
Here we first describe the concepts, components and features of CBR. The feasibility and merits of using CBR for problem solving is then explained. This is followed by a descriptio...
159
click to vote
HPDC
1998
IEEE
15 years 10 months ago
1998
IEEE
Abstract Metacomputing is the seamless application of geographically-separated distributed computing resources to user applications. We consider the scheduling of metaapplications;...