1720 search results - page 343 / 344 » Unranking Combinations in Parallel |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
IFM
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
WCRE
2010
IEEE
13 years 4 months ago
2010
IEEE
—Often stakeholders, such as developers, managers, or buyers, want to find out what software development processes are being followed within a software project. Their reasons in...
DEBU
2010
13 years 3 months ago
2010
Solid-state disks are currently based on NAND flash and expose a standard disk interface. To accommodate limitations of the medium, solid-state disk implementations avoid rewritin...
SIAMSC
2011
13 years 1 months ago
2011
The classical inexact Newton algorithm is an efficient and popular technique for solving large sparse nonlinear system of equations. When the nonlinearities in the system are wellb...