Sciweavers

79 search results - page 9 / 16
» A Recurrent Neural Network for Solving the Shortest Path Pro...
Sort
View
ECAI
1998
Springer
13 years 11 months ago
The Neural Path to Dialogue Acts
This paper presents a neural network approach to the problem of nding the dialogue act for a given utterance. So far only symbolic, decision tree and statistical approaches were ut...
M. Kipp
SDM
2012
SIAM
273views Data Mining» more  SDM 2012»
11 years 10 months ago
A Framework for the Evaluation and Management of Network Centrality
Network-analysis literature is rich in node-centrality measures that quantify the centrality of a node as a function of the (shortest) paths of the network that go through it. Exi...
Vatche Ishakian, Dóra Erdös, Evimaria ...
CAPTECH
1998
Springer
13 years 11 months ago
Artificial Neural Networks for Motion Emulation in Virtual Environments
Simulation of natural human movement has proven to be a challenging problem, difficult to be solved by more or less traditional bioinspired strategies. In opposition to several exi...
Y. Bellan, Mario Costa, Giancarlo Ferrigno, Fabriz...
NOMS
2000
IEEE
141views Communications» more  NOMS 2000»
13 years 12 months ago
IconoNET: a tool for automated bandwidth allocation planning
Communication networks are expected to offer a wide range of services to an increasingly large number of users, with a diverse range of quality of service. This calls for efficien...
Christian Frei, Boi Faltings, George Melissargos, ...
TON
2008
99views more  TON 2008»
13 years 7 months ago
On the computational complexity and effectiveness of N-hub shortest-path routing
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
Reuven Cohen, Gabi Nakibly