Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
6,411
Typestate checking and regular graph constraints
, 2002
"... Abstract We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in the presence of linked data structures, 2) shape analysis techniques, and 3) generalization of similar constrain ..."
Abstract
-
Cited by 8 (7 self)
- Add to MetaCart
Abstract We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in the presence of linked data structures, 2) shape analysis techniques, and 3) generalization of similar
Sequential Group Testing with Graph Constraints
"... Abstract—In conventional group testing, the goal is to detect a small subset of defecting items D in a large population N by grouping arbitrary subset of N into different pools. The result of each group test T is a binary output depending on whether the group contains a defective item or not. The ma ..."
Abstract
- Add to MetaCart
. The main challenge is to minimize the number of pools required to identify the set D. Motivated by applications in network monitoring and infection propagation, we consider the problem of group testing with graph constraints. As opposed to conventional group testing where any subset of items can be pooled
Symbolic Graphs for Attributed Graph Constraints I
"... In this paper we present a new class of graphs, called symbolic graphs, to de-fine a new class of constraints on attributed graphs. In particular, in the first part of the paper, we study the category of symbolic graphs showing that it satisfies some properties, which are the basis for the work that ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
In this paper we present a new class of graphs, called symbolic graphs, to de-fine a new class of constraints on attributed graphs. In particular, in the first part of the paper, we study the category of symbolic graphs showing that it satisfies some properties, which are the basis for the work
Interactive Graph Cuts for Optimal Boundary & Region Segmentation of Objects in N-D Images
, 2001
"... In this paper we describe a new technique for general purpose interactive segmentation of N-dimensional images. The user marks certain pixels as “object” or “background” to provide hard constraints for segmentation. Additional soft constraints incorporate both boundary and region information. Graph ..."
Abstract
-
Cited by 1010 (20 self)
- Add to MetaCart
In this paper we describe a new technique for general purpose interactive segmentation of N-dimensional images. The user marks certain pixels as “object” or “background” to provide hard constraints for segmentation. Additional soft constraints incorporate both boundary and region information. Graph
GRASPER A framework for graph constraint satisfaction problems
"... Abstract. In this paper we present GRASPER, a graph constraint solver, based on set constraints, that shows promising results when com-pared to an existing similar solver in this early stage of development. ..."
Abstract
- Add to MetaCart
Abstract. In this paper we present GRASPER, a graph constraint solver, based on set constraints, that shows promising results when com-pared to an existing similar solver in this early stage of development.
Describing Policies with Graph Constraints and Rules
- IN: PROC. ICGT02
, 2002
"... Policies are used to control the behavior of complex systems. In order to support reasoning about the behavior, it is necessary to have a precise specification of the policy, better if described in an intuitive visual formalism. Graphical constraints and graph transformation rules provide such a ..."
Abstract
-
Cited by 4 (3 self)
- Add to MetaCart
Policies are used to control the behavior of complex systems. In order to support reasoning about the behavior, it is necessary to have a precise specification of the policy, better if described in an intuitive visual formalism. Graphical constraints and graph transformation rules provide such a
Signal Transition Graph Constraints for Synthesis of . . .
, 1993
"... A synthesis procedure for asynchronous control circuits from a high level specification, signal transition graph (STG), is described. In this paper, we propose some syntactic constraints on STG to guarantee hazard-free implementation. We have ..."
Abstract
- Add to MetaCart
A synthesis procedure for asynchronous control circuits from a high level specification, signal transition graph (STG), is described. In this paper, we propose some syntactic constraints on STG to guarantee hazard-free implementation. We have
Graph Constraints in Constraint Programming: Weighted Spanning Trees
"... Abstract. The recently introduced CP(Graph) framework consists of a constraint solver that allows the programmer to declare variables whose values are graphs and to specify properties that these graphs should have in the form of constraints. The usefulness of graph variables depends on the existence ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract. The recently introduced CP(Graph) framework consists of a constraint solver that allows the programmer to declare variables whose values are graphs and to specify properties that these graphs should have in the form of constraints. The usefulness of graph variables depends
Algorithms for Constraint-Satisfaction Problems: A Survey
, 1992
"... A large number of problems in AI and other areas of computer science can be viewed as special cases of the constraint-satisfaction problem. Some examples are machine vision, belief maintenance, scheduling, temporal reasoning, graph problems, floor plan design, the planning of genetic experiments, an ..."
Abstract
-
Cited by 449 (0 self)
- Add to MetaCart
A large number of problems in AI and other areas of computer science can be viewed as special cases of the constraint-satisfaction problem. Some examples are machine vision, belief maintenance, scheduling, temporal reasoning, graph problems, floor plan design, the planning of genetic experiments
From Core OCL Invariants to Nested Graph Constraints
, 2014
"... Meta-modeling including the use of the Object Constraint Language (OCL) forms a well-established approach to design domain-specific modeling languages. This approach is purely declarative in the sense that instance construction is not needed and not considered. In contrast, graph grammars allow the ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
Meta-modeling including the use of the Object Constraint Language (OCL) forms a well-established approach to design domain-specific modeling languages. This approach is purely declarative in the sense that instance construction is not needed and not considered. In contrast, graph grammars allow
Results 1 - 10
of
6,411
