Sciweavers

721 search results - page 62 / 145
» On Generators of Random Quasigroup Problems
Sort
View
CORIA
2006
13 years 9 months ago
Unnatural language detection
In the context of web search engines, the escalation between ranking techniques and spamdexing techniques has led to the appearance of faked contents in web pages. If random sequen...
Thomas Lavergne
AAAI
1997
13 years 9 months ago
Summarizing CSP Hardness with Continuous Probability Distributions
We present empirical evidence that the distribution of e ort required to solve CSPs randomly generated at the 50% satis able point, when using a backtracking algorithm, can be app...
Daniel Frost, Irina Rish, Lluís Vila
GECCO
2000
Springer
120views Optimization» more  GECCO 2000»
13 years 11 months ago
An Improved Adaptive Multi-Start Approach to Finding Near-Optimal Solutions to the Euclidean TSP
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...
Dan Bonachea, Eugene Ingerman, Joshua Levy, Scott ...
CORR
2008
Springer
87views Education» more  CORR 2008»
13 years 8 months ago
The Rate Loss of Single-Letter Characterization: The "Dirty" Multiple Access Channel
For general memoryless systems, the typical information theoretic solution - when exists - has a "single-letter" form. This reflects the fact that optimum performance ca...
Tal Philosof, Ram Zamir
EUROCRYPT
2001
Springer
14 years 16 days ago
Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy
The use of elliptic curves in cryptography relies on the ability to count the number of points on a given curve. Before 1999, the SEA algorithm was the only efficient method known ...
Mireille Fouquet, Pierrick Gaudry, Robert Harley