Sciweavers

976 search results - page 176 / 196
» The Complexity of Timetable Construction Problems
Sort
View
RECOMB
2006
Springer
14 years 8 months ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...
SIGMOD
2004
ACM
189views Database» more  SIGMOD 2004»
14 years 7 months ago
A Holistic Paradigm for Large Scale Schema Matching
Schema matching is a critical problem for integrating heterogeneous information sources. Traditionally, the problem of matching multiple schemas has essentially relied on finding ...
Bin He, Kevin Chen-Chuan Chang
ECAL
2007
Springer
14 years 1 months ago
Multi-level Selection in the Emergence of Language Systematicity
Language can be viewed as a complex adaptive system which is continuously shaped and reshaped by the actions of its users as they try to solve communicative problems. To maintain c...
Luc Steels, Remi van Trijp, Pieter Wellens
ESA
2007
Springer
176views Algorithms» more  ESA 2007»
14 years 1 months ago
Arrangements in Geometry: Recent Advances and Challenges
We review recent progress in the study of arrangements in computational and combinatorial geometry, and discuss several open problems and areas for further research. In this talk I...
Micha Sharir
GECCO
2007
Springer
135views Optimization» more  GECCO 2007»
14 years 1 months ago
A cumulative evidential stopping criterion for multiobjective optimization evolutionary algorithms
In this work we present a novel and efficient algorithm– independent stopping criterion, called the MGBM criterion, suitable for Multiobjective Optimization Evolutionary Algorit...
Luis Martí, Jesús García, Ant...