942 search results - page 49 / 189 » Constraints in Graph Drawing Algorithms |
GD
2005
Springer
14 years 2 months ago
2005
Springer
Force-directed placement is a widely used approach to automatically arranging the nodes and edges of a relational diagram or graph in an aesthetically pleasing manner. The adoption...
ACL
2010
13 years 6 months ago
2010
We propose a global algorithm for learning entailment relations between predicates. We define a graph structure over predicates that represents entailment relations as directed ed...
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
Distributed Constraint Optimization (DCOP) is a popular framework for cooperative multi-agent decision making. DCOP is NPhard, so an important line of work focuses on developing f...
TCAD
2008
13 years 8 months ago
2008
Abstract--The electrostatic discharge (ESD) problem has become a challenging reliability issue in nanometer-circuit design. High voltages that resulted from ESD might cause high cu...
IWPC
2000
IEEE
14 years 1 months ago
2000
IEEE
Call graphs are commonly used as input for automatic clustering algorithms, the goal of which is to extract the high level structure of the program under study. Determining the ca...