Sciweavers

2477 search results - page 404 / 496
» Approximate extended formulations
Sort
View
NC
1998
13 years 11 months ago
An Addition to Backpropagation for Computing Functional Roots
Many processes are composed of a n-fold repetition of some simpler process. If the whole process can be modeled with a neural network, we present a method to derive a model of the...
Lars Kindermann
NETWORKING
2000
13 years 11 months ago
An Exact Algorithm for Calculating Blocking Probabilities in Multicast Networks
Abstract. The paper deals with tree-structured point-to-multipoint networks, where users from infinite user populations at the leaf nodes subscribe to a variety of channels, offere...
Eeva Nyberg, Jorma T. Virtamo, Samuli Aalto
IJCAI
1997
13 years 11 months ago
Model Minimization, Regression, and Propositional STRIPS Planning
Propositional STRIPS planning problems can be viewed as finite state automata (FSAs) represented in a factored form. Automaton minimization is a well-known technique for reducing ...
Robert Givan, Thomas Dean
SIROCCO
1997
13 years 11 months ago
Static Frequency Assignment in Cellular Networks
A cellular network is generally modeled as a subgraph of the triangular lattice. In the static frequency assignment problem, each vertex of the graph is a base station in the netw...
Lata Narayanan, Sunil M. Shende
NIPS
1992
13 years 11 months ago
Some Solutions to the Missing Feature Problem in Vision
In visual processing the ability to deal with missing and noisy information is crucial. Occlusions and unreliable feature detectors often lead to situations where little or no dir...
Subutai Ahmad, Volker Tresp