Sciweavers

244 search results - page 26 / 49
» Towards a Theory of Extractable Functions
Sort
View
FLAIRS
2003
13 years 9 months ago
Sample Complexity of Real-Coded Evolutionary Algorithms
Researchers studying Evolutionary Algorithms and their applications have always been confronted with the sample complexity problem. The relationship between population size and gl...
Jian Zhang 0007, Xiaohui Yuan, Bill P. Buckles
JCC
2007
90views more  JCC 2007»
13 years 7 months ago
Aromaticity in linear polyacenes: Generalized population analysis and molecular quantum similarity approach
Abstract: The relative aromaticity of benzenoid rings in the linear polyacenes is investigated using two novel aromaticity approaches. According to the first, the aromaticity of i...
Patrick Bultinck, Robert Ponec, Ramon Carbó...
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
13 years 11 months ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam
ISMM
2009
Springer
14 years 2 months ago
Spatially-Variant Anisotropic Morphological Filters Driven by Gradient Fields
Abstract. This paper deals with the theory and applications of spatially-variant mathematical morphology. We formalize the definition of spatially variant dilation/erosion and ope...
Rafael Verdú Monedero, Jesús Angulo,...
ODR
2008
13 years 9 months ago
A Multi-Agent Architecture for Online Dispute Resolution Services
: Argumentation theory is often used in multi agent-systems to facilitate autonomous agent reasoning and multi-agent interaction. The technology can also be used to develop online ...
Brooke Abrahams, John Zeleznikow