1951 search results - page 202 / 391 » An algorithm for improving graph partitions |
345
click to vote
AAIM
2011
Springer
14 years 9 months ago
2011
Springer
A star forest is a collection of vertex-disjoint trees of depth at most 1, and its size is the number of leaves in all its components. A spanning star forest of a given graph G is ...
164
click to vote
ILP
2003
Springer
15 years 10 months ago
2003
Springer
RRL is a relational reinforcement learning system based on Q-learning in relational state-action spaces. It aims to enable agents to learn how to act in an environment that has no ...
186
click to vote
SPAA
1993
ACM
15 years 9 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
157
Voted
CORR
2010
Springer
15 years 5 months ago
2010
Springer
The premise of automated alert correlation is to accept that false alerts from a low level intrusion detection system are inevitable and use attack models to explain the output in ...
160
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Designing and implementing efficient, provably correct parallel machine learning (ML) algorithms is challenging. Existing high-level parallel abstractions like MapReduce are insuf...