Sciweavers

142 search results - page 12 / 29
» On-the-Fly Clause Improvement
Sort
View
SAT
2007
Springer
184views Hardware» more  SAT 2007»
14 years 1 months ago
Circuit Based Encoding of CNF Formula
In this paper a new circuit sat based encoding of boolean formula is proposed. It makes an original use of the concept of restrictive models introduced by Boufkhad to polynomially ...
Gilles Audemard, Lakhdar Sais
HVC
2005
Springer
94views Hardware» more  HVC 2005»
14 years 1 months ago
HaifaSat: A New Robust SAT Solver
Abstract. HaifaSat is a new SAT solver that is based on a new decision heuristic called Clause-Move-To-Front (CMTF), a new resolutionbased scoring strategy and many other improveme...
Roman Gershman, Ofer Strichman
SEUS
2009
IEEE
14 years 2 months ago
Using Context Awareness to Improve Quality of Information Retrieval in Pervasive Computing
Publish-subscribe-query information broker middleware offers great promise to users of pervasive computing systems requiring access to information. However, users of publish-subscr...
Joseph P. Loyall, Richard E. Schantz
GECCO
2009
Springer
121views Optimization» more  GECCO 2009»
14 years 9 days ago
Using memetic algorithms to improve portfolio performance in static and dynamic trading scenarios
The Portfolio Optimization problem consists of the selection of a group of assets to a long-term fund in order to minimize the risk and maximize the return of the investment. This...
Claus de Castro Aranha, Hitoshi Iba
JAR
2010
98views more  JAR 2010»
13 years 2 months ago
Proof-Guided Test Selection from First-Order Specifications with Equality
This paper deals with test case selection from axiomatic specifications whose axioms are quantifier-free first-order formulas with equality. We first prove the existence of an ide...
Delphine Longuet, Marc Aiguier, Pascale Le Gall