While large language models (LLMs) have recently demonstrated strong potential in solving planning problems, there is a trade-off between flexibility and complexity. LLMs, as zero-shot planners themselves, are still n...
详细信息
In recently years there has been plenty of interest in Random constraint Satisfaction Problem, both from an experimental and a theoretical point of view. In this paper we study and analyze the four popular problem ins...
详细信息
In recently years there has been plenty of interest in Random constraint Satisfaction Problem, both from an experimental and a theoretical point of view. In this paper we study and analyze the four popular problem instance generating models, and present the extended model B+ based on the most used model B, which has the different domains and constraint tightness meeting some probability distribution function. In the subsequent section we give the relation matrix version of backtracking integrated forward checking algorithms, and introduce the implementation of instances generator and solver based on the new model. Finally we show the experiment results and conclude the paper, point that our extended model B+ has the common phase transition region with the transitional models and it has the advantage of being suited to the testing of heuristic based constraint solving algorithms, such as variables selection heuristic algorithms.
With the growing demand for more efficient hardware accelerators for streaming applications, a novel Coarse-Grained Reconfigurable Architecture (CGRA) that uses a Distributed Two-Level Control (D2LC) system has been p...
详细信息
ISBN:
(纸本)9783981926361
With the growing demand for more efficient hardware accelerators for streaming applications, a novel Coarse-Grained Reconfigurable Architecture (CGRA) that uses a Distributed Two-Level Control (D2LC) system has been proposed in the literature. Even though the highly distributed and parallel structure makes it fast and energy-efficient, the single-issue instruction channel between the level-1 and level-2 controller in each D2LC cell becomes the bottleneck of its performance. In this paper, we improve its design to mimic a multi-issued architecture by inserting shadow instruction buffers between the level-1 and level-2 controllers. Together with a zero-overhead hardware loop, the improved D2LC architecture can enable efficient overlap between loop iterations. We also propose a complete constraint programming based instruction scheduling algorithm to support the above hardware features. The experiment result shows that the improved D2LC architecture can achieve up to 25% of reduction on the instruction execution cycles and 35% reduction on the energy-delay product.
constraint programming is an emerging technology that offers an original approach allowing for efficient and flexible solving of complex problems. Its main advantage relies in its ability to compute with partial infor...
详细信息
ISBN:
(纸本)9780769504155
constraint programming is an emerging technology that offers an original approach allowing for efficient and flexible solving of complex problems. Its main advantage relies in its ability to compute with partial information expressed in terms of *** constraints are monotonically accumulated during the program execution in order to restrict the problem search space. In this paper we address one of the cornerstones of this technology, namely the current lack of debugging facilities. In particular, visualization and understanding of the underlying constraint system during program executions is very important. We propose to structure this huge, flat and intricate part of the execution data in order to provide access to high level examination of its evolution. More precisely, we present a means to hierarchically organize sets of constraints in order to divide them into manageable parts while preserving computation correctness. Soundness of our method is shown, an algorithm supporting it is given, and an implemented prototype exhibiting its effectiveness is described.
constraint Logic programming (CLP) is a language scheme for combining two declarative paradigms: constraint solving and logic programming. Concurrent constraint programming (CCP) is a declarative model for concurrency...
详细信息
Thesis defense is the procedure where a graduation candidate defends his thesis in front of a committee. This procedure usually involves a committee with special composition, while several other rules have to be enfor...
详细信息
ISBN:
(纸本)9781450398541
Thesis defense is the procedure where a graduation candidate defends his thesis in front of a committee. This procedure usually involves a committee with special composition, while several other rules have to be enforced too. The problem of scheduling many thesis defenses in a designated period of time is a problem known to the timetabling community and is hard to solve. In this work, we experiment on a benchmark dataset that was released along with a formal description of the Problem. We employ three mathematical models and combine them to create a three phase approach. We test this approach with both Integer and constraint programming solvers and manage to achieve high quality results, while most of them are better than the formerly best known.
Rule-based programming experiences renaissance due to its applications in areas such as Business Rules, Semantic Web, Computational Biology, Verification and Security. Executable rules are used in declarative programm...
详细信息
ISBN:
(纸本)9781595933881
Rule-based programming experiences renaissance due to its applications in areas such as Business Rules, Semantic Web, Computational Biology, Verification and Security. Executable rules are used in declarative programming languages, in program transformation and analysis, and for reasoning in artificial intelligence *** Handling Rules (CHR) [6, 8, 11] is a concurrent committed-choice constraint logic programming language consisting of guarded rules that transform multi-sets of atomic formulas (constraints) into simpler ones until exhaustion. CHR was initially developed for solving constraints, but has matured into a general-purpose concurrent constraint language over the last decade, because it can embed many rule-based formalisms and describe algorithms in a declarative way. The clean semantics of CHR facilitates non-trivial program analysis and transformation
A balanced short-term planning model by constraint Satisfaction Problem was *** model is to assign orders including make-to-order and make-to-stock to periods dynamically,satisfy all the constraints in process,split t...
详细信息
ISBN:
(纸本)9781612848334
A balanced short-term planning model by constraint Satisfaction Problem was *** model is to assign orders including make-to-order and make-to-stock to periods dynamically,satisfy all the constraints in process,split them when needed depending on capacity limits,target to maximizing customer satisfaction and utilization of resource capacity,clarify the quantity could be delivery,delayed and *** to the complexity of the actual problem,the algorithm of constraint genetic algorithm based on order split was presented,through two groups of experiments with real data and simulated data proved that this algorithm is practical,feasible and optimized,the versatility and flexibility of this model both the algorithm also is well to accommodate to complex application.
This paper provides a novel perspective in the protein structure prediction (PSP) problem. The PSP problem focuses on determining putative 3D structures of a protein starting from its primary sequence. The proposed ap...
详细信息
This paper provides a novel perspective in the protein structure prediction (PSP) problem. The PSP problem focuses on determining putative 3D structures of a protein starting from its primary sequence. The proposed approach relies on a multi-agent system (MAS) perspective, where concurrent agents explore the folding of different parts of a protein. The strength of the approach lies in the agents' ability to apply different types of knowledge, expressed in the form of declarative constraints, to prune the search space of folding alternatives. The paper makes also an important contribution in demonstrating the suitability of a general-purpose graphical processing unit approach to implement such MAS infrastructure, with significant performance improvements over the sequential implementation and other methods.
LODE is a web tool for deaf children, which aims at stimulating global reasoning on written e-stories. This paper reports on an initial prototype application of LODE. First, we motivate the need of an e-tool such as L...
详细信息
ISBN:
(纸本)9781595939760
LODE is a web tool for deaf children, which aims at stimulating global reasoning on written e-stories. This paper reports on an initial prototype application of LODE. First, we motivate the need of an e-tool such as LODE for deaf children, then we report on the assessment of the prototype with expert users and two deaf children, laying the groundwork for the final evaluation and development of LODE.
暂无评论