Sciweavers

3136 search results - page 503 / 628
» Complex networks and evolutionary computation
Sort
View
IJCNN
2007
IEEE
16 years 22 days ago
Optimizing 0/1 Loss for Perceptrons by Random Coordinate Descent
—The 0/1 loss is an important cost function for perceptrons. Nevertheless it cannot be easily minimized by most existing perceptron learning algorithms. In this paper, we propose...
Ling Li, Hsuan-Tien Lin
DSOM
2005
Springer
15 years 12 months ago
Towards Automated Deployment of Built-to-Order Systems
Abstract. End-to-end automated application design and deployment poses a significant technical challenge. With increasing scale and complexity of IT systems and the manual handling...
Akhil Sahai, Calton Pu, Gueyoung Jung, Qinyi Wu, W...
ISNN
2005
Springer
15 years 12 months ago
A Block-Adaptive Subspace Method Using Oblique Projections for Blind Separation of Convolutive Mixtures
This paper presents a block-adaptive subspace algorithm via oblique projection for blind source separation (BSS) problem of convolutive mixtures. In the proposed algorithm, the pro...
Chunyi Peng, Xianda Zhang, Qutang Cai
POLICY
2005
Springer
15 years 12 months ago
Obligation Policies: An Enforcement Platform
The use of policy-based mechanisms significantly reduces the complexity associated with applicational development and operation. In particular, history-based policies allow the s...
Pedro Gama, Paulo Ferreira
SETN
2004
Springer
15 years 11 months ago
A Meta-classifier Approach for Medical Diagnosis
Abstract. Single classifiers, such as Neural Networks, Support Vector Machines, Decision Trees and other, can be used to perform classification of data for relatively simple proble...
George L. Tsirogiannis, Dimitrios S. Frossyniotis,...