Sciweavers

879 search results - page 134 / 176
» Optimizing for Reduced Code Space using Genetic Algorithms
Sort
View
IRI
2009
IEEE
15 years 8 months ago
Using 4KB Page Size for Virtual Memory is Obsolete
A 4KB page size has been used for Virtual Memory since the sixties. In fact, today, the most common page size is still 4KB. Choosing a page size is finding the middle ground betwe...
Pinchas Weisberg, Yair Wiseman
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
15 years 5 months ago
Evolutionary learning with kernels: a generic solution for large margin problems
In this paper we embed evolutionary computation into statistical learning theory. First, we outline the connection between large margin optimization and statistical learning and s...
Ingo Mierswa
KDD
2007
ACM
153views Data Mining» more  KDD 2007»
16 years 2 months ago
Exploiting duality in summarization with deterministic guarantees
Summarization is an important task in data mining. A major challenge over the past years has been the efficient construction of fixed-space synopses that provide a deterministic q...
Panagiotis Karras, Dimitris Sacharidis, Nikos Mamo...
111
Voted
ICML
2006
IEEE
16 years 2 months ago
Iterative RELIEF for feature weighting
RELIEF is considered one of the most successful algorithms for assessing the quality of features. In this paper, we propose a set of new feature weighting algorithms that perform s...
Yijun Sun, Jian Li
PACT
2005
Springer
15 years 7 months ago
Optimal Behavior of a Moving Creature in the Cellular Automata Model
The goal of our investigation is to find automatically the best rule for a cell in the cellular automata model. The cells are either of type Obstacle, Empty or Creature. Only Crea...
Mathias Halbach, Rolf Hoffmann