Sciweavers

971 search results - page 155 / 195
» Approximate Satisfiability and Equivalence
Sort
View
COCO
1998
Springer
98views Algorithms» more  COCO 1998»
15 years 4 months ago
Probabilistic Martingales and BPTIME Classes
We define probabilistic martingales based on randomized approximation schemes, and show that the resulting notion of probabilistic measure has several desirable robustness propert...
Kenneth W. Regan, D. Sivakumar
EPIA
1997
Springer
15 years 4 months ago
GenSAT: A Navigational Approach
GenSATis a family of local hill-climbing procedures for solving propositional satisfiability problems.We restate it as a navigational search process performed on an N-dimensionalc...
Yury V. Smirnov, Manuela M. Veloso
HT
1996
ACM
15 years 4 months ago
HyPursuit: A Hierarchical Network Search Engine that Exploits Content-Link Hypertext Clustering
HyPursuit is a new hierarchical network search engine that clusters hypertext documents to structure a given information space for browsing and search activities. Our content-link...
Ron Weiss, Bienvenido Vélez, Mark A. Sheldo...
DAC
2009
ACM
15 years 3 months ago
RegPlace: a high quality open-source placement framework for structured ASICs
Structured ASICs have recently emerged as an exciting alternative to ASIC or FPGA design style as they provide a new trade-off between the high performance of ASIC design and low ...
Ashutosh Chakraborty, Anurag Kumar, David Z. Pan
GECCO
2007
Springer
184views Optimization» more  GECCO 2007»
15 years 3 months ago
Multi-objective optimization tool for a free structure analog circuits design using genetic algorithms and incorporating parasit
This paper presents a novel approach for a free structure analog circuit design using Genetic Algorithms (GA). A major problem in a free structure circuit is its sensitivity calcu...
Yaser M. A. Khalifa, Badar K. Khan, Faisal Taha