Results 1  10
of
524,160
Constraint Graph Visualization
"... This paper presents some ideas for visualizing constraint graphs. The motivation for constraint graph visualization is for better understanding and debugging of CP (constraint programming) programs. (Constraint graphs also have the potential for visualizing logic programs such as Prolog programs.) T ..."
Abstract
 Add to MetaCart
This paper presents some ideas for visualizing constraint graphs. The motivation for constraint graph visualization is for better understanding and debugging of CP (constraint programming) programs. (Constraint graphs also have the potential for visualizing logic programs such as Prolog programs
Testing Properties of ConstraintGraphs
 Proceedings of the 22 nd IEEE Annual Conference on Computational Complexity (CCC 2007
"... We study a model of graph related formulae that we call the ConstraintGraph model. A constraintgraph is a labeled multigraph (a graph where loops and parallel edges are allowed), where each edge e is labeled by a distinct Boolean variable and every vertex is associate with a Boolean function over ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
We study a model of graph related formulae that we call the ConstraintGraph model. A constraintgraph is a labeled multigraph (a graph where loops and parallel edges are allowed), where each edge e is labeled by a distinct Boolean variable and every vertex is associate with a Boolean function over
Constraint propagation for loose constraint graphs
, 2006
"... In this paper we investigate how to improve propagationbased finite domain constraint solving by making use of the constraint graph to choose propagators to execute in a better order. If the constraint graph is not too densely connected we can build an underlying tree of biconnected components, and ..."
Abstract
 Add to MetaCart
In this paper we investigate how to improve propagationbased finite domain constraint solving by making use of the constraint graph to choose propagators to execute in a better order. If the constraint graph is not too densely connected we can build an underlying tree of biconnected components
Multilevel algorithms for multiconstraint graph partitioning
 In Proceedings of Supercomputing
, 1998
"... ( kirk, karypis, kumar) @ cs.umn.edu ..."
Constraint Networks
, 1992
"... Constraintbased reasoning is a paradigm for formulating knowledge as a set of constraints without specifying the method by which these constraints are to be satisfied. A variety of techniques have been developed for finding partial or complete solutions for different kinds of constraint expression ..."
Abstract

Cited by 1149 (43 self)
 Add to MetaCart
Constraintbased reasoning is a paradigm for formulating knowledge as a set of constraints without specifying the method by which these constraints are to be satisfied. A variety of techniques have been developed for finding partial or complete solutions for different kinds of constraint
Path Consistency for Triangulated Constraint Graphs
 In Proc. of the 16 �¡ IJCAI
, 1999
"... bliekQilog.fr Among the local consistency techniques used in the resolution of constraint satisfaction problems (CSPs), path consistency (PC) has received a great deal of attention. A constraint graph G is PC if for any valuation of a pair of variables that satisfy the constraint in G between them, ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
bliekQilog.fr Among the local consistency techniques used in the resolution of constraint satisfaction problems (CSPs), path consistency (PC) has received a great deal of attention. A constraint graph G is PC if for any valuation of a pair of variables that satisfy the constraint in G between them
Constraint Graph Analysis of Multithreaded Programs
 In PACT ’03: Proceedings of the 12th International Conference on Parallel Architectures and Compilation Techniques
, 2004
"... This paper presents a framework for analyzing the performance of multithreaded programs using a model called a constraint graph. We review previous constraint graph definitions for sequentially consistent systems, and extend these definitions for use in analyzing other memory consistency models. ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
This paper presents a framework for analyzing the performance of multithreaded programs using a model called a constraint graph. We review previous constraint graph definitions for sequentially consistent systems, and extend these definitions for use in analyzing other memory consistency models
Partial Online Cycle Elimination in Inclusion Constraint Graphs
 IN PROCEEDINGS OF THE 1998 ACM SIGPLAN CONFERENCE ON PROGRAMMING LANGUAGE DESIGN AND IMPLEMENTATION
, 1998
"... Many program analyses are naturally formulated and implemented using inclusion constraints. We present new results on the scalable implementation of such analyses based on two insights: first, that online elimination of cyclic constraints yields ordersofmagnitude improvements in analysis time for ..."
Abstract

Cited by 127 (14 self)
 Add to MetaCart
Many program analyses are naturally formulated and implemented using inclusion constraints. We present new results on the scalable implementation of such analyses based on two insights: first, that online elimination of cyclic constraints yields ordersofmagnitude improvements in analysis time
Community detection in graphs
, 2009
"... The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of th ..."
Abstract

Cited by 801 (1 self)
 Add to MetaCart
The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices
Constraint Logic Programming: A Survey
"... Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve in differe ..."
Abstract

Cited by 864 (25 self)
 Add to MetaCart
Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve
Results 1  10
of
524,160