1941 search results - page 12 / 389 » On Generalizations of Network Design Problems with Degree Bo... |
ICDCS
2010
IEEE
15 years 1 months ago
2010
IEEE
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
114
click to vote
IJCNN
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract— The optimal model parameters of a kernel machine are typically given by the solution of a convex optimisation problem with a single global optimum. Obtaining the best p...
SWAT
1994
Springer
15 years 1 months ago
1994
Springer
We present sequential and parallel algorithms for various embedding problems on bounded degree partial k-trees and k-connected partial k-trees these include subgraph isomorphism a...
PODC
2004
ACM
15 years 3 months ago
2004
ACM
We consider the problem of designing a compact communication network that supports efficient routing in an Euclidean plane. Our network design and routing scheme achieves 1+ stret...
UM
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Since problem solving in group problem-based learning is a collaborative process, modeling individuals and the group is necessary if we wish to develop an intelligent tut...