Sciweavers

6437 search results - page 531 / 1288
» Parallel Algorithms for Arrangements
Sort
View
200
Voted
PPSN
2004
Springer
16 years 1 days ago
A Primer on the Evolution of Equivalence Classes of Bayesian-Network Structures
Bayesian networks (BN) constitute a useful tool to model the joint distribution of a set of random variables of interest. To deal with the problem of learning sensible BN models fr...
Jorge Muruzábal, Carlos Cotta
178
Voted
IPPS
1999
IEEE
15 years 11 months ago
Solving Satisfiability Problems on FPGAs using Experimental Unit Propagation Heuristic
This paperpresents new resultson anapproach for solvingsatisfiability problems (SAT), that is, creating a logic circuit that is specialized to solve each problem instance on Field ...
Takayuki Suyama, Makoto Yokoo, Akira Nagoya
SPAA
2000
ACM
15 years 10 months ago
Generalized connection caching
Cohen et al. [5] recently initiated the theoretical study of connection caching in the world-wide web. They extensively studied uniform connection caching, where the establishment...
Susanne Albers
WIA
2000
Springer
15 years 10 months ago
Fast Implementations of Automata Computations
Abstract. In 6], G. Myers describes a bit-vector algorithm to compute the edit distance between strings. The algorithm converts an input sequence to an output sequence in a paralle...
Anne Bergeron, Sylvie Hamel
HIPC
2009
Springer
15 years 4 months ago
Automatic data placement and replication in grids
Data grids provide geographically distributed storage and computing resources for large data-intensive applications. To support fast data access and processing, effective data man...
Ying Ding, Ying Lu