1129 search results - page 191 / 226 » SAC and neighbourhood SAC |
196
click to vote
SAC
2011
ACM
14 years 9 months ago
2011
ACM
A moving region whose location and extend change over time can imply topological changes such as region split and hole formation. To study this phenomenon is useful in many applic...
202
click to vote
SAC
2011
ACM
14 years 9 months ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
349
click to vote
SAC
2011
ACM
14 years 9 months ago
2011
ACM
Slice sampling provides an easily implemented method for constructing a Markov chain Monte Carlo (MCMC) algorithm. However, slice sampling has two major drawbacks: (i) it requires...
161
click to vote
FCCM
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper describes the implementation of an automatic target recognition ATR Probing algorithm on a recon gurable system, using the SA-C programming language and optimizing co...
146
click to vote
ISSAC
1989
Springer
15 years 10 months ago
1989
Springer
In this paper, we describe a parallelization scheme for Collins’ cylindrical algebraic decomposition algorithm for quantifier elimination in the theory of real closed fields. ...