Sciweavers

1022 search results - page 95 / 205
» Logspace Complexity of Functions and Structures
Sort
View
BMCBI
2007
143views more  BMCBI 2007»
14 years 10 months ago
An adaptive bin framework search method for a beta-sheet protein homopolymer model
Background: The problem of protein structure prediction consists of predicting the functional or native structure of a protein given its linear sequence of amino acids. This probl...
Alena Shmygelska, Holger H. Hoos
ISAAC
2007
Springer
70views Algorithms» more  ISAAC 2007»
15 years 4 months ago
Kinetic Maintenance of Mobile k-Centres on Trees
Let C denote a set of n mobile clients, each of which follows a continuous trajectory on a weighted tree T. We establish tight bounds on the maximum relative velocity of the 1-cent...
Stephane Durocher, Christophe Paul
LFCS
2007
Springer
15 years 4 months ago
Verifying Balanced Trees
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
Zohar Manna, Henny B. Sipma, Ting Zhang
PROMAS
2005
Springer
15 years 3 months ago
Extending the Capability Concept for Flexible BDI Agent Modularization
Abstract. Multi-agent systems are a natural way of decomposing complex systems into more manageable and decentralized units. Nevertheless, as single agents can represent complex su...
Lars Braubach, Alexander Pokahr, Winfried Lamersdo...
ICAISC
2010
Springer
15 years 2 months ago
An Evolutionary Algorithm for Global Induction of Regression Trees
In the paper a new evolutionary algorithm for induction of univariate regression trees is proposed. In contrast to typical top-down approaches it globally searches for the best tre...
Marek Kretowski, Marcin Czajkowski