Sciweavers

4679 search results - page 61 / 936
» Modeling When Connections Are the Problem
Sort
View
NETWORKS
2010
14 years 12 months ago
Probabilistic models for the Steiner Tree problem
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
Vangelis Th. Paschos, Orestis Telelis, Vassilis Zi...
VLSI
2005
Springer
15 years 7 months ago
Modeling the Traffic Effect for the Application Cores Mapping Problem onto NoCs
This work addresses the problem of application mapping in networks-on-chip (NoCs) having as goal to minimize the total dynamic energy consumption of a complex system-on-a-chip (So...
César A. M. Marcon, José Carlos S. P...
DSN
2005
IEEE
15 years 7 months ago
On Partial Protection in Groomed Optical WDM Mesh Networks
In this paper, we consider the problem of survivable network design in traffic groomed optical WDM mesh networks with sub-wavelength capacity connections. In typical survivable n...
Jing Fang, Mahesh Sivakumar, Arun K. Somani, Krish...
ITS
2004
Springer
155views Multimedia» more  ITS 2004»
15 years 6 months ago
Modeling the Development of Problem Solving Skills in Chemistry with a Web-Based Tutor
This research describes a probabilistic approach for developing predictive models of how students learn problem-solving skills in general qualitative chemistry. The goal is to use ...
Ron Stevens, Amy Soller, Melanie Cooper, Marcia Sp...
CONNECTION
2004
98views more  CONNECTION 2004»
15 years 1 months ago
Self-refreshing memory in artificial neural networks: learning temporal sequences without catastrophic forgetting
While humans forget gradually, highly distributed connectionist networks forget catastrophically: newly learned information often completely erases previously learned information. ...
Bernard Ans, Stephane Rousset, Robert M. French, S...