1998 search results - page 323 / 400 » Complexity of the Cover Polynomial |
115
click to vote
RTCSA
2006
IEEE
15 years 6 months ago
2006
IEEE
In most real-time applications, deadlines are artifices that need to be enforced to meet different performance requirements. For example, in periodic task sets, jitter requiremen...
112
Voted
ACSAC
2005
IEEE
15 years 6 months ago
2005
IEEE
The typical means by which an attacker breaks into a network is through a chain of exploits, where each exploit in the chain lays the groundwork for subsequent exploits. Such a ch...
94
Voted
ICDM
2005
IEEE
15 years 6 months ago
2005
IEEE
Data mining algorithms are facing the challenge to deal with an increasing number of complex objects. For graph data, a whole toolbox of data mining algorithms becomes available b...
103
click to vote
GD
2005
Springer
15 years 6 months ago
2005
Springer
A clustered graph has its vertices grouped into clusters in a hierarchical way via subset inclusion, thereby imposing a tree structure on the clustering relationship. The c-planari...
118
Voted
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
In Genetic algorithms it is not easy to evaluate the confidence level in whether a GA run may have missed a complete area of good points, and whether the global optimum was found....