Bounded fractional hypertree width is the most general known structural property that guarantees polynomial-time solvability of the constraint satisfaction problem. Fichte et al. (cp 2018) presented a robust and ...
详细信息
Weighted average expressions frequently appear in the context of allocation problems with balancing based constraints. In combinatorial optimization they are typically avoided by exploiting problems specificities or b...
详细信息
Multi-valued decision diagrams (MDDs) were introduced into constraintprogramming over a decade ago as a powerful alternative to domain propagation. While effective MDD-propagation algorithms have been proposed for va...
详细信息
the proceedings contain 36 papers. the special focus in this conference is on theory and practice of Natural Computing. the topics include: A linear constrained optimization benchmark for probabilistic search algorith...
ISBN:
(纸本)9783030040697
the proceedings contain 36 papers. the special focus in this conference is on theory and practice of Natural Computing. the topics include: A linear constrained optimization benchmark for probabilistic search algorithms: the rotated klee-minty problem;the design of (almost) disjunct matrices by evolutionary algorithms;how the “Baldwin Effect” can guide evolution in dynamic environments;landscape-aware constraint handling applied to differential evolution;fuel efficient truck platooning with time restrictions and multiple speeds solved by a particle swarm optimisation;automated design of genetic programming classification algorithms for financial forecasting using evolutionary algorithms;optimizing fleet staging of air ambulances in the Province of Ontario;a Hierarchical approach to grammar-guided genetic programming: the case of scheduling in heterogeneous networks;multi-memetic mind evolutionary computation algorithm based on the landscape analysis;computing preimages and ancestors in reaction systems;DNA-guided assembly of nanocellulose meshes;classically time-controlled quantum automata;mortal organisms rescue immortal organisms from evolutionary inertness: Perspective of the programmed self-decomposition model;integrative biological, cognitive and affective modeling of a drug-therapy for a post-traumatic stress disorder;symbolic analysis of machine behaviour and the emergence of the machine language;it is time to dissolve old dichotomies in order to grasp the whole picture of cognition;network-oriented modeling of the interaction of adaptive joint decision making, bonding and mirroring;network reification as a unified approach to represent network adaptation principles within a network;relating an adaptive network’s structure to its emerging behaviour for Hebbian learning;on capacity with incremental learning by simplified chaotic neural network.
作者:
Bistarelli, S.Gennari, R.Rossi, F.Università di Pisa
Dipartimento di Informatica Corso Italia 40 Pisa56125 Italy ILLC
Institute of Logic Language and Computation University of Amsterdam N. Doelenstraat 15 Amsterdam1012 CP Netherlands Università di Padova
Dipartimento di Matematica Pura ed Applicata Via Belzoni 7 Padova35131 Italy
Soft constraints based on semirings are a generalization of classical constraints, where tuples of variables’ values in each soft constraint are uniquely associated to elements from an algebraic structure called semi...
详细信息
Consistencies are properties of constraint networks that can be enforced by appropriate algorithms to reduce the size of the search space to be explored. Recently, many consistencies built upon taking decisions (most ...
详细信息
We describe a system which generates finite domain constraint models from positive example solutions, for highly structured problems. the system is based on the global constraint catalog, providing the library of cons...
详细信息
Many cumulative problems are such that the horizon is fixed and cannot be delayed. In this situation, it often occurs that all the activities cannot be scheduled without exceeding the capacity at some points in time. ...
详细信息
A depth-first search algorithm can be used to find optimal solutions of a constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g., a cp-net). this involves checking at e...
详细信息
Tractable classes of binary CSP and binary Max-CSP have recently been discovered by studying classes of instances defined by excluding subproblems. In this paper we characterise the complexity of all classes of binary...
详细信息
暂无评论