Search
Search Results
-
Simulation of apple tree branch growth using an improved point-cloud-boundary-constraint model
The apple is a valuable commercial crop. Morphological information on and visual simulation of the apple plant are critical for precise and...
-
On the lengths of tree-like and Dag-like cutting plane refutations of Horn constraint systems
In this paper, we investigate the properties of cutting plane based refutations for a class of integer programs called Horn constraint systems (HCSs). ...
-
CSP beyond tractable constraint languages
The constraint satisfaction problem (CSP) is among the most studied computational problems. While NP-hard, many tractable subproblems have been...
-
Constraint Propagation on GPU: A Case Study for the Cumulative Constraint
The Cumulative constraint is one of the most important global constraints, as it naturally arises in a variety of problems related to scheduling with...
-
A spanning tree approach to social network sampling with degree constraints
Online social networks (OSNs) have become increasingly popular on the web in recent years. There are millions of users on these networks, and they...
-
Constraint-free discretized manifold-based path planner
Autonomous robotic path planning in partially known environments, such as warehouse robotics, deals with static and dynamic constraints. Static...
-
Quantifying robustness: 3D tree point cloud skeletonization with smart-tree in noisy domains
Extracting tree skeletons from 3D tree point clouds is challenged by noise and incomplete data. While our prior work (Dobbs et al., in: Iberian...
-
Slim Tree-Cut Width
Tree-cut width is a parameter that has been introduced as an attempt to obtain an analogue of treewidth for edge cuts. Unfortunately, in spite of its...
-
Differentially private multi-agent constraint optimization
Distributed constraint optimization (DCOP) is a framework in which multiple agents with private constraints (or preferences) cooperate to achieve a...
-
Weighted Tree Automata with Constraints
The HOM problem, which asks whether the image of a regular tree language under a given tree homomorphism is again regular, is known to be decidable...
-
Toward fast belief propagation for distributed constraint optimization problems via heuristic search
Belief propagation (BP) approaches, such as Max-sum and its variants, are important methods to solve large-scale Distributed Constraint Optimization...
-
A subspace constraint based approach for fast hierarchical graph embedding
Hierarchy network, as a type of complex graphs, is widely used in many application scenarios such as social network analysis in web, human resource...
-
An improved frequent pattern tree: the child structured frequent pattern tree CSFP-tree
Frequent itemsets are itemsets that occur frequently in a dataset. Frequent itemset mining extracts specific itemsets with supports higher than or...
-
Online learning of variable ordering heuristics for constraint optimisation problems
Solvers for constraint optimisation problems exploit variable and value ordering heuristics. Numerous expert-designed heuristics exist, while recent...
-
An adversarial training-based mutual information constraint method
As an auxiliary loss function, the mutual information constraint is widely used in various deep learning tasks, such as deep reinforcement learning...
-
Tree Data Structures
A tree is one of the more typical graph structures you will implement using a SQL Server database. As covered in Chapter 1, a tree is a directed...
-
Proof Logging for the Circuit Constraint
Proof logging in constraint programming is an approach to certifying a conclusion reached by a solver. To allow for this, different propagators must...
-
Tree-Like Unit Refutations in Horn Constraint Systems
In this paper, we examine the problem of finding unit refutations of Horn constraint systems (HCSs). Recall that a Horn constraint is a linear...
-
Computing Most Likely Scenarios of Qualitative Constraint Networks
Qualitative constraint networks are widely used to represent knowledge bases in qualitative spatial and temporal reasoning (QSTR). However,...
-
Multi-constraint shortest path using forest hop labeling
The Multi-Constraint Shortest Path (MCSP) problem aims to find the shortest path between two nodes in a network subject to a given constraint set. It...
