Sciweavers

126 search results - page 16 / 26
» Finding minimal bases in arbitrary spline spaces
Sort
View
103
Voted
ECAI
2008
Springer
14 years 11 months ago
A Decomposition Technique for Max-CSP
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
Hachemi Bennaceur, Christophe Lecoutre, Olivier Ro...
NN
2000
Springer
192views Neural Networks» more  NN 2000»
14 years 9 months ago
A new algorithm for learning in piecewise-linear neural networks
Piecewise-linear (PWL) neural networks are widely known for their amenability to digital implementation. This paper presents a new algorithm for learning in PWL networks consistin...
Emad Gad, Amir F. Atiya, Samir I. Shaheen, Ayman E...
JSAC
2006
112views more  JSAC 2006»
14 years 9 months ago
Optimal Bandwidth Allocation in a Delay Channel
In this paper, we consider the problem of allocating bandwidth to two queues with arbitrary arrival processes, so as to minimize the total expected packet holding cost over a finit...
Navid Ehsan, Mingyan Liu
TNN
2010
234views Management» more  TNN 2010»
14 years 4 months ago
Novel maximum-margin training algorithms for supervised neural networks
This paper proposes three novel training methods, two of them based on the back-propagation approach and a third one based on information theory for Multilayer Perceptron (MLP) bin...
Oswaldo Ludwig, Urbano Nunes
AUSAI
2005
Springer
15 years 3 months ago
K-Optimal Pattern Discovery: An Efficient and Effective Approach to Exploratory Data Mining
Most data-mining techniques seek a single model that optimizes an objective function with respect to the data. In many real-world applications several models will equally optimize...
Geoffrey I. Webb