10988 search results - page 238 / 2198 » Algorithmic Folding Complexity |
129
click to vote
SEMWEB
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Much data is published on the Web in XML format satisfying schemas, and to make the Semantic Web a reality, such data needs to be interpreted with respect to ontologies. ...
177
click to vote
HYBRID
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. We define a new class of hybrid automata for which reachability is decidable--a proper superclass of the initialized rectangular hybrid automata--by taking parallel compo...
147
click to vote
DAGSTUHL
2006
15 years 5 months ago
2006
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
142
click to vote
ICANN
2010
Springer
15 years 4 months ago
2010
Springer
We propose a data structure that decreases complexity of unsupervised competitive learning algorithms which are based on the growing cells structures approach. The idea is based on...
108
Voted
CORR
2008
Springer
15 years 4 months ago
2008
Springer
The observation and modeling of natural Complex Systems (CSs) like the human nervous system, the evolution or the weather, allows the definition of special abilities and models re...