164 search results - page 2 / 33 » A Smallest Generalization Step Strategy |
CP
2005
Springer
15 years 3 months ago
2005
Springer
Classical methods for solving numerical CSPs are based on a branch and prune algorithm, a dichotomic enumeration process interleaved with a consistency filtering algorithm. In man...
SIAMSC
2010
14 years 7 months ago
2010
We outline a new class of robust and efficient methods for solving the Navier– Stokes equations. We describe a general solution strategy that has two basic building blocks: an im...
OPODIS
2007
14 years 11 months ago
2007
Abstract. Blin et al. (2006) proposed a distributed protocol that enables the smallest number of searchers to clear any unknown asynchronous graph in a decentralized manner. Unknow...
ANSS
2001
IEEE
15 years 1 months ago
2001
IEEE
In this work, we study the different buffering techniques used in the literature to solve the contention problem in A TM switching architectures. The objective of our study is to ...
CRYPTO
2006
Springer
15 years 1 months ago
2006
Springer
Abstract Lattice reduction is a hard problem of interest to both publickey cryptography and cryptanalysis. Despite its importance, extremely few algorithms are known. The best algo...