942 search results - page 68 / 189 » Constraints in Graph Drawing Algorithms |
GECCO
2004
Springer
14 years 3 months ago
2004
Springer
This paper describes a continuous estimation of distribution algorithm (EDA) to solve decomposable, real-valued optimization problems quickly, accurately, and reliably. This is the...
IWMMDBMS
1996
13 years 11 months ago
1996
We introduce a constraint-driven methodology for the automated assembly, organization and playout of presentations from multimedia databases. We use inclusion and exclusion constr...
MP
2010
13 years 4 months ago
2010
In many practical applications, the task is to optimize a non-linear objective function over the vertices of a well-studied polytope as, e.g., the matching polytope or the travelli...
AIRS
2005
Springer
14 years 3 months ago
2005
Springer
PageRank is one of the most popular link analysis algorithms that have shown their effectiveness in web search. However, PageRank only consider hyperlink information. In this paper...
COMGEO
2012
ACM
12 years 5 months ago
2012
ACM
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...