Sciweavers

61 search results - page 9 / 13
» Performance analysis of niching algorithms based on derandom...
Sort
View
SAT
2010
Springer
172views Hardware» more  SAT 2010»
13 years 6 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin
SIGIR
1999
ACM
14 years 1 days ago
Probabilistic Latent Semantic Indexing
Probabilistic Latent Semantic Indexing is a novel approach to automated document indexing which is based on a statistical latent class model for factor analysis of count data. Fit...
Thomas Hofmann
ANOR
2007
80views more  ANOR 2007»
13 years 7 months ago
The minimum shift design problem
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
Luca Di Gaspero, Johannes Gärtner, Guy Kortsa...
WEWORC
2007
162views Cryptology» more  WEWORC 2007»
13 years 9 months ago
New Attacks on the Stream Cipher TPy6 and Design of New Ciphers the TPy6-A and the TPy6-B
The stream ciphers Py, Pypy and Py6 were designed by Biham and Seberry for the ECRYPT-eSTREAM project in 2005. The ciphers were promoted to the ‘Focus’ ciphers of the Phase II ...
Gautham Sekar, Souradyuti Paul, Bart Preneel
SIGMETRICS
2008
ACM
113views Hardware» more  SIGMETRICS 2008»
13 years 7 months ago
Layered interval codes for tcam-based classification
Ternary content-addressable memories (TCAMs) are increasingly used for high-speed packet classification. TCAMs compare packet headers against all rules in a classification database...
Anat Bremler-Barr, David Hay, Danny Hendler, Boris...