20573 search results - page 281 / 4115 » The Computer's New Clothes |
186
click to vote
PPAM
2005
Springer
16 years 6 days ago
2005
Springer
Algorithms for the sparse matrix-vector multiplication (shortly SpM×V ) are important building blocks in solvers of sparse systems of linear equations. Due to matrix sparsity, the...
173
click to vote
PVM
2005
Springer
16 years 6 days ago
2005
Springer
We present design and implementation details as well as performance results for two new parallel checkpointing libraries developed by us for parallel MPI applications. The first o...
185
click to vote
SAT
2005
Springer
16 years 6 days ago
2005
Springer
We introduce ApproxCount, an algorithm that approximates the number of satisfying assignments or models of a formula in propositional logic. Many AI tasks, such as calculating degr...
202
click to vote
AMAI
2004
Springer
16 years 4 days ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
199
click to vote
LCN
2003
IEEE
16 years 4 hour ago
2003
IEEE
In a multi-hop wireless network, each node is able to send a message to all of its neighbors that are located within its transmission radius. In a flooding task, a source sends th...