2006 search results - page 309 / 402 » Heuristic Security-Testing Methods |
ICDM
2009
IEEE
14 years 4 months ago
2009
IEEE
Given a data matrix, the problem of finding dense/uniform sub-blocks in the matrix is becoming important in several applications. The problem is inherently combinatorial since th...
ICTAI
2009
IEEE
14 years 4 months ago
2009
IEEE
Existing density-based data stream clustering algorithms use a two-phase scheme approach consisting of an online phase, in which raw data is processed to gather summary statistics...
IPPS
2009
IEEE
14 years 4 months ago
2009
IEEE
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...
ARGMAS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We introduce a special family of (assumption-based argumentation) frameworks for reasoning about the bene ts of decisions. These frameworks can be used for representing t...
GECCO
2009
Springer
14 years 3 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...