16 search results - page 3 / 4 » Propagation = Lazy Clause Generation |
ECAI
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. In this paper, we present a new way to preprocess Boolean formulae in Conjunctive Normal Form (CNF). In contrast to most of the current pre-processing techniques, our app...
CADE
2000
Springer
13 years 10 months ago
2000
Springer
Abstract. This article introduces two techniques to improve the propagation efficiency of CSP based finite model generation methods. One approach consists in statically rewriting ...
CORR
2002
Springer
13 years 5 months ago
2002
Springer
: We study the satisfiability of randomly generated formulas formed by M clauses of exactly K literals over N Boolean variables. For a given value of N the problem is known to be m...
WOWMOM
2005
ACM
13 years 11 months ago
2005
ACM
Constructing indoor radio maps plays an important role in many services and applications such as wireless base station planning. In this paper, we propose a hybrid approach to con...
IPPS
2007
IEEE
14 years 2 days ago
2007
IEEE
In large-scale distributed systems, asynchronous communication and future objects are becoming wide spread mechanisms to tolerate high latencies and to improve global performances...