370 search results - page 60 / 74 » Computational Study on Dominating Set Problem of Planar Grap... |
102
click to vote
EDOC
2009
IEEE
15 years 3 months ago
2009
IEEE
This paper studies the following problem: given a pair of business process models, determine which elements in one model are related to which elements in the other model. This prob...
112
click to vote
PR
2007
14 years 11 months ago
2007
In this paper, we make use of the relationship between the Laplace–Beltrami operator and the graph Laplacian, for the purposes of embedding a graph onto a Riemannian manifold. T...
113
click to vote
SIGMOD
2011
ACM
14 years 2 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
MOBIHOC
2007
ACM
15 years 11 months ago
2007
ACM
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
122
click to vote
CEC
2011
IEEE
13 years 11 months ago
2011
IEEE
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...