Sciweavers

1242 search results - page 135 / 249
» A Computational Complexity Theory in Membrane Computing
Sort
View
GECCO
2007
Springer
148views Optimization» more  GECCO 2007»
15 years 4 months ago
Exploring the behavior of building blocks for multi-objective variation operator design using predator-prey dynamics
In this paper, we utilize a predator-prey model in order to identify characteristics of single-objective variation operators in the multi-objective problem domain. In detail, we a...
Christian Grimme, Joachim Lepping, Alexander Papas...
SAC
2004
ACM
15 years 3 months ago
A decision-theoretic approach for designing proactive communication in multi-agent teamwork
Techniques that support effective communication during teamwork processes are of particular importance. Psychological study shows that an effective team often can anticipate infor...
Yu Zhang, Richard A. Volz, Thomas R. Ioerger, John...
COCO
2001
Springer
149views Algorithms» more  COCO 2001»
15 years 2 months ago
Quantum versus Classical Learnability
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
Rocco A. Servedio, Steven J. Gortler
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
15 years 2 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
ISCAS
1994
IEEE
131views Hardware» more  ISCAS 1994»
15 years 2 months ago
An Efficient Design Method for Optimal Weighted Median Filtering
Earlier research has shown that the problem of optimal weighted median filtering with structural constraints can be formulated as a nonconvex nonlinear programming problem in gene...
Ruikang Yang, Moncef Gabbouj, Yrjö Neuvo