Browse Proceedings

Presents the front cover of the proceedings record.

Presents the title page of the proceedings record.

Presents the title page of the proceedings record.

Presents the introductory welcome message from the conference proceedings. May include the conference officers' congratulations to all involved with the conference event and publication of the proceedings record.

Presents the introductory welcome message from the conference proceedings. May include the conference officers' congratulations to all involved with the conference event and publication of the proceedings record.

Provides a listing of current committee members and society officers.

Provides a listing of current committee members and society officers.

Presents the introductory welcome message from the conference proceedings. May include the conference officers' congratulations to all involved with the conference event and publication of the proceedings record.

Provides a listing of current committee members and society officers.

The conference offers a note of thanks and lists its reviewers.

Provides an abstract of the keynote presentation and a brief professional biography of the presenter. The complete presentation was not made available for publication as part of the conference proceedings.

Provides an abstract of the keynote presentation and a brief professional biography of the presenter. The complete presentation was not made available for publication as part of the conference proceedings.

Provides an abstract of the keynote presentation and a brief professional biography of the presenter. The complete presentation was not made available for publication as part of the conference proceedings.

Depending on the nature of CSP instances to consider, the decomposition methods offer an approach often efficient for the solving, the counting of solutions or the optimization. So, the community has focused a large part of its efforts on the design of ...

Considerable research effort has been focused on the translation of non-binary CSP into an equivalent binary CSP. Most of this work has been devoted to studying the binary encoding of non-binary CSP. Three encodings have been proposed, namely dual ...

In the latest years and with the advancements of the multicore computing world, the constraint programming community tried to benefit from the capacity of new machines and make the best use of them through several parallel schemes for constraint ...

Given a collection of algorithms, the Algorithm Selection (AS) problem consists in identifying which of them is the best one for solving a given problem. The selection depends on a set of numerical features that characterize the problem to solve. In ...

We introduce the notion of Optimal Patterns (OPs), defined as the best patterns according to a given user preference, and show that OPs encompass many data mining problems. Then, we propose a generic method based on a Dynamic Constraint Satisfaction ...

Machine Reassignment is a challenging problem for constraint programming (CP) and mixed integer linear programming (MILP) approaches, especially given the size of data centres. The multi-objective version of the Machine Reassignment Problem is even more ...

In this paper, we mainly propose an online learning method for adaptive traffic signal control in a multi-intersection system. The method uses approximate dynamic programming (ADP) to achieve a near-optimal solution of the signal optimization in a ...

The effective use of autonomous robot teams in highly-critical missions depends on being able to establish performance guarantees. However, establishing a guarantee for the behavior of an autonomous robot operating in an uncertain environment with ...

It is well known that the problem of finding a feasible schedule for a partially ordered set of tasks can be formulated as a Disjunctive Temporal Problem (DTP). In case we want to find a schedule by taking preferences into account, there exist ...

Recent work has demonstrated that hyperparameter optimization within the sequential model-based optimization (SMBO) framework is generally possible. This approach replaces the expensive-to-evaluate function that maps hyperparameters to the performance ...

OWL EL is a tractable fragment of OWL 2. Classification, which is the task of computing a subsumption hierarchy between concepts, plays an important role in many applications of OWL EL. The current classification methods are proposed based on the ...

In this paper, we consider the effect of different order relations on the solutions of Multi-Objective Constraint Optimization Problems (MOCOP) with tradeoffs, where the tradeoffs are given in the form of elicited or observed preferences over ...

The easy solution of the selection tasks with social contract rules, compared to the poor results of the original formulation of the tasks with descriptive rules, has been interpreted, in the framework of massive modularity hypothesis, as the evidence ...

An argument is seen as reason in favour of a claim. It is made of three parts: a set of premises representing the reason, a conclusion representing the supported claim, and a connection showing how the premises lead to the conclusion. Arguments are ...

Preferences can be expressed as wishes, constraints or both. Generally, wishes and constraints do not complement each other. A different reasoning principle is applied to rank-order the set of options depending on whether preferences refer to wishes or ...

The exponential growth of the size of the search space has always been an obstacle to POMDP planning. Heuristics are often used to reduce the search space size and improve computational efficiency. As the advantage of the feature of POMDP problems ...