Sciweavers

789 search results - page 67 / 158
» Solving Complex Problems Efficiently with Adaptive Automata
Sort
View
CORR
2004
Springer
94views Education» more  CORR 2004»
14 years 9 months ago
Quantum Computing, Postselection, and Probabilistic Polynomial-Time
I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coin...
Scott Aaronson
JMM2
2007
96views more  JMM2 2007»
14 years 9 months ago
A Framework for Linear Transform Approximation Using Orthogonal Basis Projection
—This paper aims to develop a novel framework to systematically trade-off computational complexity with output distortion in linear multimedia transforms, in an optimal manner. T...
Yinpeng Chen, Hari Sundaram
AAMAS
2008
Springer
14 years 10 months ago
A capabilities-based model for adaptive organizations
Multiagent systems have become popular over the last few years for building complex, adaptive systems in a distributed, heterogeneous setting. Multiagent systems tend to be more r...
Scott A. DeLoach, Walamitien H. Oyenan, Eric T. Ma...
EUMAS
2006
14 years 11 months ago
Self-regulating Multi-agent System for Multi-disciplinary Optimisation Process
This article presents a multi-agent method to tackle multidisciplinary optimisation, based on the notions of cooperation and self-regulation. It is focused on the preliminary airc...
Jean-Baptiste Welcomme, Marie Pierre Gleizes, Roma...
ICPR
2006
IEEE
15 years 11 months ago
Bagging Based Efficient Kernel Fisher Discriminant Analysis for Face Recognition
Kernel Fisher Discriminant Analysis (KFDA) has achieved great success in pattern recognition recently. However, the training process of KFDA is too time consuming (even intractabl...
Baochang Zhang, Shiguang Shan, Wen Gao, Xilin Chen...