260 search results - page 3 / 52 » Range and Set Abstraction using SAT |
IJCAI
2007
13 years 7 months ago
2007
Abstract. In this paper, nogood recording is investigated for CSP within the randomization and restart framework. Our goal is to avoid the same situations to occur from one run to ...
IJSNET
2006
13 years 6 months ago
2006
Abstract: This paper addresses the target coverage problem in wireless sensor networks with adjustable sensing range. Communication and sensing consume energy, therefore efficient ...
PRICAI
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. We consider the problem of computing optimal plans for propositional planning problems with action costs. In the spirit of leveraging advances in general-purpose automate...
SAT
2007
Springer
14 years 12 days ago
2007
Springer
Abstract. In this paper we study NP-hard weighted satisfiability optimization problems for the class 2-CNF providing worst-case upper time bounds. Moreover we consider the monoton...
SAT
2007
Springer
14 years 12 days ago
2007
Springer
Abstract. The adaptive noise mechanism was introduced in Novelty+ to automatically adapt noise settings during the search [4]. The local search algorithm G2 WSAT deterministically ...