1120 search results - page 104 / 224 » Parallel Algorithmic Techniques for Combinatorial Computatio... |
ICPADS
1998
IEEE
14 years 1 months ago
1998
IEEE
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...
SPIN
2004
Springer
14 years 2 months ago
2004
Springer
The Murϕ-based Hopper tool is a general purpose explicit model checker. Hopper leverages Murϕ’s class structure to implement new algorithms. Hopper differs from Murϕ in that i...
ICDCS
2000
IEEE
14 years 1 months ago
2000
IEEE
We present resolvent-based learning as a new nogood learning method for a distributed constraint satisfaction algorithm. This method is based on a look-back technique in constrain...
ANCS
2009
ACM
13 years 7 months ago
2009
ACM
Deterministic Finite Automaton (DFA) is well-known for its constant matching speed in worst case, and widely used in multistring matching, which is a critical technique in high pe...
ICDCN
2011
Springer
13 years 21 days ago
2011
Springer
In this paper, we propose to use graph-mining techniques to understand the communication pattern within a data-centre. We model the communication observed within a data-centre as a...