Zobrazeno 1 - 10
of 129
pro vyhledávání: '"Hofstedt, Petra"'
This volume constitutes the pre-proceedings of the DECLARE 2019 conference, held on September 9 to 13, 2019 at the University of Technology Cottbus - Senftenberg (Germany). Declarative programming is an advanced paradigm for the modeling and solving
Externí odkaz:
http://arxiv.org/abs/1909.04870
Icosoku is a challenging and interesting puzzle that exhibits highly symmetrical and combinatorial nature. In this paper, we pose the questions derived from the puzzle, but with more difficulty and generality. In addition, we also present a constrain
Externí odkaz:
http://arxiv.org/abs/1908.06003
This paper describes a new approach on optimization of constraint satisfaction problems (CSPs) by means of substituting sub-CSPs with locally consistent regular membership constraints. The purpose of this approach is to reduce the number of fails in
Externí odkaz:
http://arxiv.org/abs/1908.05907
Autor:
Schneeweiss, Denny, Hofstedt, Petra
We present a constraint-based approach to interactive product configuration. Our configurator tool FdConfig is based on feature models for the representation of the product domain. Such models can be directly mapped into constraint satisfaction probl
Externí odkaz:
http://arxiv.org/abs/1108.5586
Autor:
Hofstedt, Petra
We discuss the realization of evaluation strategies for the concurrent constraint-based functional language CCFL within the translation schemata when compiling CCFL programs into the hierarchical graph rewriting language LMNtal. The support of LMNtal
Externí odkaz:
http://arxiv.org/abs/1009.3770
Autor:
Hofstedt, Petra, Pepper, Peter
Combining a set of existing constraint solvers into an integrated system of cooperating solvers is a useful and economic principle to solve hybrid constraint problems. In this paper we show that this approach can also be used to integrate different l
Externí odkaz:
http://arxiv.org/abs/cs/0511090
Publikováno v:
ISPRS Annals of Photogrammetry, Remote Sensing & Spatial Information Sciences; 2024, Vol. 10 Issue 4/W5, p163-169, 7p
Publikováno v:
Artificial Intelligence Applications and Innovations
The performance of solving a constraint problem can often be improved by converting a subproblem into a single constraint (for example into a regular membership constraint or a table constraint). In the past, it stood out, that specialist constraint
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pmc_________::2051df289f845d6a92372afc7223cf94
http://europepmc.org/articles/PMC7256598
http://europepmc.org/articles/PMC7256598
The solution performance of finite domain (FD) constraint problems can often be improved by either transforming particular constraints or sub-problems into other FD constraints like binary, table or regular membership constraints, or by transformatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f22a69077c97a3a448f05d16d42a0b03