4403 search results - page 329 / 881 » Galois Theory of Algorithms |
181
click to vote
WABI
2005
Springer
16 years 7 days ago
2005
Springer
—We propose new algorithms for computing pairwise rearrangement scenarios that conserve the combinatorial structure of genomes. More precisely, we investigate the problem of sort...
160
click to vote
FSTTCS
2004
Springer
16 years 4 days ago
2004
Springer
Abstract. Monolithic finite-state probabilistic programs have been abstractly modeled by finite Markov chains, and the algorithmic verification problems for them have been inves...
162
click to vote
ISNN
2004
Springer
16 years 3 days ago
2004
Springer
Abstract. In this paper, some sufficient conditions are obtained to guarantee that discrete time cellular neural networks (DTCNNs) can have some stable memory patterns. These condi...
155
click to vote
COMPGEOM
2003
ACM
16 years 11 hour ago
2003
ACM
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...
173
click to vote
SPAA
2003
ACM
16 years 4 hour ago
2003
ACM
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...