1161 search results - page 132 / 233 » Kinetic Dependence Graphs |
151
click to vote
SLS
2009
Springer
15 years 11 months ago
2009
Springer
Stochastic local search algorithms can now successfully solve MAXSAT problems with thousands of variables or more. A key to this success is how effectively the search can navigate...
162
click to vote
IWPC
2006
IEEE
15 years 11 months ago
2006
IEEE
Large software systems have a rich development history. Mining certain aspects of this rich history can reveal interesting insights into the system and its structure. Previous app...
135
click to vote
VALUETOOLS
2006
ACM
15 years 11 months ago
2006
ACM
We study how the spread of computer viruses, worms, and other self-replicating malware is affected by the logical topology of the network over which they propagate. We consider a...
142
click to vote
WG
2005
Springer
15 years 10 months ago
2005
Springer
We prove that for all 0 ≤ t ≤ k and d ≥ 2k, every graph G with treewidth at most k has a ‘large’ induced subgraph H, where H has treewidth at most t and every vertex in ...
140
click to vote
ICPR
2010
IEEE
15 years 9 months ago
2010
IEEE
Semantic analysis of a document collection can be viewed as an unsupervised clustering of the constituent words and documents around hidden or latent concepts. This has shown to i...