Sciweavers

83 search results - page 2 / 17
» Boundary value problems on weighted networks
Sort
View
AIED
2009
Springer
13 years 12 months ago
Detecting the Learning Value of Items In a Randomized Problem Set
Researchers that make tutoring systems would like to know which pieces of educational content are most effective at promoting learning among their students. Randomized controlled e...
Zachary A. Pardos, Neil T. Heffernan
NETWORKS
2008
13 years 5 months ago
A linear programming approach to increasing the weight of all minimum spanning trees
Given a graph where increasing the weight of an edge has a nondecreasing convex piecewise linear cost, we study the problem of finding a minimum cost increase of the weights so tha...
Mourad Baïou, Francisco Barahona
NETWORKS
2010
13 years 3 months ago
Complexity of some inverse shortest path lengths problems
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
Tingting Cui, Dorit S. Hochbaum
JUCS
2011
174views more  JUCS 2011»
13 years 7 days ago
Color Image Restoration Using Neural Network Model
Abstract: Neural network learning approach for color image restoration has been discussed in this paper and one of the possible solutions for restoring images has been presented. H...
Satyadhyan Chickerur, Aswatha Kumar M.
ISCC
2006
IEEE
133views Communications» more  ISCC 2006»
13 years 11 months ago
Choosing Weights for IP Network Dimensioning Optimization
Often in Internet Protocol (IP) networks, links are assigned weights, and traffic demands are routed along shortest paths. Hence, these link weights are the parameters which dete...
Olivier Klopfenstein, Sebastien Mamy