Sciweavers

2266 search results - page 242 / 454
» Evolutionary Algorithms for the Satisfiability Problem
Sort
View
ASPDAC
2009
ACM
108views Hardware» more  ASPDAC 2009»
15 years 9 months ago
SAT-controlled redundancy addition and removal: a novel circuit restructuring technique
- We proposed a novel Boolean Satisfiability (SAT)-controlled redundancy addition and removal (RAR) algorithm to resolve the performance and quality problems of
Chi-An Wu, Ting-Hao Lin, Shao-Lun Huang, Chung-Yan...
ORL
2008
116views more  ORL 2008»
15 years 3 months ago
Explicit gradient information in multiobjective optimization
This paper presents an algorithm that converges to points that satisfy a first order necessary condition of weakly Pareto solutions of multiobjective optimization problems. Hints ...
Ubaldo M. García-Palomares, Juan C. Burguil...
138
Voted
IJCIA
2002
137views more  IJCIA 2002»
15 years 3 months ago
Co-Evolution in Social Interactions
An interesting problem which has been widely investigated is under what circumstances will a society of rational agents realize some particular stable situations, and whether they ...
Hiroshi Sato, Akira Namatame
ECAI
1994
Springer
15 years 7 months ago
The SAT Phase Transition
We describe a detailed experimental investigation of the phase transition for several different classes of randomly generated satisfiability problems. We observe a remarkable consi...
Ian P. Gent, Toby Walsh
STOC
2002
ACM
118views Algorithms» more  STOC 2002»
16 years 3 months ago
On the advantage over a random assignment
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
Johan Håstad, Srinivasan Venkatesh