Sciweavers

909 search results - page 46 / 182
» On the approximability of some network design problems
Sort
View
TNN
2008
88views more  TNN 2008»
15 years 1 months ago
A New Approach to Knowledge-Based Design of Recurrent Neural Networks
Abstract-- A major drawback of artificial neural networks (ANNs) is their black-box character. This is especially true for recurrent neural networks (RNNs) because of their intrica...
Eyal Kolman, Michael Margaliot
136
Voted
NN
2002
Springer
224views Neural Networks» more  NN 2002»
15 years 1 months ago
Optimal design of regularization term and regularization parameter by subspace information criterion
The problem of designing the regularization term and regularization parameter for linear regression models is discussed. Previously, we derived an approximation to the generalizat...
Masashi Sugiyama, Hidemitsu Ogawa
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
16 years 1 months ago
Approximating minimum bounded degree spanning trees to within one of optimal
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Mohit Singh, Lap Chi Lau
EAAI
2010
119views more  EAAI 2010»
15 years 3 days ago
A heuristic-based framework to solve a complex aircraft sizing problem
Aircraft sizing studies consist in determining the main characteristics of an aircraft starting from a set of requirements. These studies can be summarized as global constrained o...
Céline Badufle, Christophe Blondel, Thierry...
PE
2010
Springer
129views Optimization» more  PE 2010»
14 years 12 months ago
Optimal monotone forwarding policies in delay tolerant mobile ad-hoc networks
—In this paper we describe a framework for the optimal control of delay tolerant mobile ad hoc networks where multiple classes of nodes co-exist. We specialize the description of...
Eitan Altman, Tamer Basar, Francesco De Pellegrini