AI
2006
Springer
14 years 1 months ago
2006
Springer
Stochastic local search (SLS) methods are underlying some of the best-performing algorithms for certain types of SAT instances, both from an empirical as well as from a theoretical...
AAIM
2006
Springer
14 years 1 months ago
2006
Springer
We investigate LP-polytopes generated by mean payoff games and their properties, including the existence of tight feasible solutions of bounded size. We suggest a new associated al...
AAIM
2006
Springer
14 years 1 months ago
2006
Springer
Due to the increasing security threats on the Internet, new overlay network architectures have been proposed to secure privileged services. In these architectures, the application...
AAECC
2006
Springer
14 years 1 months ago
2006
Springer
We study the design of structured Tanner codes with low error-rate floors on the AWGN channel. The design technique involves the "doping" of standard LDPC (proto-)graphs,...
0
posts
with
0
views
0
views
COCO
2009
Springer
14 years 1 months ago
2009
Springer
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
KDD
2010
ACM
14 years 1 months ago
2010
ACM
The detection of repeated subsequences, time series motifs, is a problem which has been shown to have great utility for several higher-level data mining algorithms, including clas...
ICANNGA
2009
Springer
14 years 1 months ago
2009
Springer
A new evolutionary algorithm, Elitistic Evolution (termed EEv), is proposed in this paper. EEv is an evolutionary method for numerical optimization with adaptive behavior. EEv uses...
ICANNGA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The use of support vector machines for multi-category problems is still an open field to research. Most of the published works use the one-against-rest strategy, but with...
ICANNGA
2007
Springer
14 years 1 months ago
2007
Springer
