Sciweavers

665 search results - page 3 / 133
» Using Generalized Annotated Programs to Solve Social Network...
Sort
View
PDPTA
1996
13 years 8 months ago
Solving a 2D Knapsack Problem on an Associative Computer Augmented with a Linear Network
This paper describes a parallelization of the sequential dynamic programming method for solving a 2D knapsack problem where multiples of n rectangular objects are optimally packed...
Darrell R. Ulm, Johnnie W. Baker
SOCIALCOM
2010
13 years 5 months ago
A Scalable Framework for Modeling Competitive Diffusion in Social Networks
Multiple phenomena often diffuse through a social network, sometimes in competition with one another. Product adoption and political elections are two examples where network diffus...
Matthias Broecheler, Paulo Shakarian, V. S. Subrah...
IJCNN
2000
IEEE
13 years 12 months ago
Using Hopfield Networks to Solve Traveling Salesman Problems Based on Stable State Analysis Technique
In our recent work, a general method called the stable state analysis technique was developed to determine constraints that the weights in the Hopfield energy function must satisf...
Gang Feng, Christos Douligeris
CORR
2008
Springer
150views Education» more  CORR 2008»
13 years 7 months ago
A Dynamic Programming Framework for Combinatorial Optimization Problems on Graphs with Bounded Pathwidth
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, ...
Mugurel Ionut Andreica
KDD
2010
ACM
244views Data Mining» more  KDD 2010»
13 years 6 months ago
Finding effectors in social networks
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
Theodoros Lappas, Evimaria Terzi, Dimitrios Gunopu...