738 search results - page 29 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
143
click to vote
SPAA
2005
ACM
15 years 11 months ago
2005
ACM
We study randomized algorithms for placing a sequence of n nodes on a circle with unit perimeter. Nodes divide the circle into disjoint arcs. We desire that a newly-arrived node (...
155
click to vote
ICPR
2008
IEEE
16 years 10 days ago
2008
IEEE
We propose a method to improve the results of image search engines on the Internet to satisfy users who desire to see relevant images in the first few pages. The method re-ranks ...
166
click to vote
PARLE
1987
1987
Emulating Digital Logic using Transputer Networks (very High Parallelism = Simplicity = Performance)
15 years 9 months ago
Modern VLSI technology has changed the economic rules by which the balance between processing power, memory and communications is decided in computing systems. This will have a pr...
199
click to vote
JOC
2010
15 years 20 days ago
2010
Let g be an element of prime order p in an abelian group and let Zp. We show that if g, g , and gd are given for a positive divisor d of p - 1, the secret key can be computed de...
173
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Self-adaptation is used a lot in Evolutionary Strategies and with great success, yet for some reason it is not the mutation adaptation of choice for Genetic Algorithms. This poste...