942 search results - page 96 / 189 » Constraints in Graph Drawing Algorithms |
INFOCOM
2005
IEEE
14 years 3 months ago
2005
IEEE
— We consider wireless sensor networks with multiple gateways and multiple classes of traffic carrying data generated by different sensory inputs. The objective is to devise joi...
SIGCSE
2004
ACM
14 years 3 months ago
2004
ACM
A framework for producing dynamic data structure visualizations within the context of a lightweight IDE is described. Multiple synchronized visualizations of a data structure can ...
COMGEO
2011
ACM
13 years 5 months ago
2011
ACM
A drawing of a graph in the plane is called a thrackle if every pair of edges meets precisely once, either at a common vertex or at a proper crossing. Let t(n) denote the maximum ...
ECAI
2008
Springer
13 years 11 months ago
2008
Springer
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
IJCAI
2003
13 years 11 months ago
2003
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...