3265 search results - page 452 / 653 » Representing Groups on Graphs |
186
click to vote
GECCO
2005
Springer
16 years 1 days ago
2005
Springer
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
170
click to vote
ESA
2004
Springer
15 years 12 months ago
2004
Springer
The computation of dominators in a flowgraph has applications in several areas, including program optimization, circuit testing, and theoretical biology. Lengauer and Tarjan [30]...
201
click to vote
PASTE
2010
ACM
15 years 11 months ago
2010
ACM
Recently there has been significant interest in employing probabilistic techniques for fault localization. Using dynamic dependence information for multiple passing runs, learnin...
218
click to vote
ICALP
2001
Springer
15 years 11 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
163
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
We introduce a simple variation of the additive heuristic used in the HSP planner that combines the benefits of the original additive heuristic, namely its mathematical formulation...