Sciweavers

11371 search results - page 36 / 2275
» The network inhibition problem
Sort
View
SDM
2011
SIAM
284views Data Mining» more  SDM 2011»
13 years 1 months ago
The Network Completion Problem: Inferring Missing Nodes and Edges in Networks
While the social and information networks have become ubiquitous, the challenge of collecting complete network data still persists. Many times the collected network data is incomp...
Myunghwan Kim 0002, Jure Leskovec
STOC
2001
ACM
122views Algorithms» more  STOC 2001»
14 years 10 months ago
Provisioning a virtual private network: a network design problem for multicommodity flow
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...
Anupam Gupta, Jon M. Kleinberg, Amit Kumar, Rajeev...
PEWASUN
2007
ACM
13 years 11 months ago
Solving the user-to-host binding problem in ad hoc networks through photo-ids
José Cano, Juan-Carlos Cano, Carlos Miguel ...
NETWORKS
2010
13 years 8 months ago
A mean-variance model for the minimum cost flow problem with stochastic arc costs
This paper considers a minimum cost flow problem where arc costs are uncertain, and the decision maker wishes to minimize both the expected flow cost and the variance of this co...
Stephen D. Boyles, S. Travis Waller
IJCNN
2006
IEEE
14 years 4 months ago
A Columnar Competitive Model with Simulated Annealing for Solving Combinatorial Optimization Problems
— One of the major drawbacks of the Hopfield network is that when it is applied to certain polytopes of combinatorial problems, such as the traveling salesman problem (TSP), the...
Eu Jin Teoh, Huajin Tang, Kay Chen Tan