Sciweavers

4114 search results - page 499 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
CADE
2001
Springer
16 years 7 months ago
Context Trees
Context trees are a popular and effective tool for tasks such as compression, sequential prediction, and language modeling. We present an algebraic perspective of context trees for...
Harald Ganzinger, Robert Nieuwenhuis, Pilar Nivela
WEBDB
2009
Springer
115views Database» more  WEBDB 2009»
16 years 1 months ago
A Machine Learning Approach to Foreign Key Discovery
We study the problem of automatically discovering semantic associations between schema elements, namely foreign keys. This problem is important in all applications where data sets...
Alexandra Rostin, Oliver Albrecht, Jana Bauckmann,...
GLOBECOM
2006
IEEE
16 years 23 days ago
Distributed Formation of Overlapping Multi-hop Clusters in Wireless Sensor Networks
– Clustering is a standard approach for achieving efficient and scalable performance in wireless sensor networks. Most of the published clustering algorithms strive to generate t...
Adel M. Youssef, Mohamed F. Younis, Moustafa Youss...
EMO
2006
Springer
219views Optimization» more  EMO 2006»
15 years 10 months ago
ParadisEO-MOEO: A Framework for Evolutionary Multi-objective Optimization
Abstract. This paper presents ParadisEO-MOEO, a white-box objectoriented generic framework dedicated to the flexible design of evolutionary multi-objective algorithms. This paradig...
Arnaud Liefooghe, Matthieu Basseur, Laetitia Jourd...
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
15 years 10 months ago
Algebraic simplification of GP programs during evolution
Program bloat is a fundamental problem in the field of Genetic Programming (GP). Exponential growth of redundant and functionally useless sections of programs can quickly overcome...
Phillip Wong, Mengjie Zhang