Sciweavers

2266 search results - page 38 / 454
» Evolutionary Algorithms for the Satisfiability Problem
Sort
View
IADIS
2008
15 years 1 months ago
Gapbnf_Rule: A Genetic Miner Rule
The aim of this paper is to present an evolutionary system for classification problem called GAPBNF_Rule. GAPBNF_Rule is a powerful evolutionary method that distinguishes between ...
Rasha Shakir Abdul-Wahhab
CIG
2005
IEEE
15 years 5 months ago
Co-evolutionary Strategies for an Alternating-Offer Bargaining Problem
Abstract- In this paper, we apply an Evolutionary Algorithm (EA) to solve the Rubinstein’s Basic AlternatingOffer Bargaining Problem, and compare our experimental results with it...
Nanlin Jin, Edward P. K. Tsang
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
14 years 12 months ago
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna
AAAI
1998
15 years 1 months ago
Learning Evaluation Functions for Global Optimization and Boolean Satisfiability
This paper describes STAGE, a learning approach to automatically improving search performance on optimization problems.STAGElearns an evaluation function which predicts the outcom...
Justin A. Boyan, Andrew W. Moore
CAV
2012
Springer
227views Hardware» more  CAV 2012»
13 years 2 months ago
Minimum Satisfying Assignments for SMT
Abstract. A minimum satisfying assignment of a formula is a minimumcost partial assignment of values to the variables in the formula that guarantees the formula is true. Minimum sa...
Isil Dillig, Thomas Dillig, Kenneth L. McMillan, A...