601 search results - page 42 / 121 » CSP(M): Constraint Satisfaction Problem over Models |
107
click to vote
CPAIOR
2005
Springer
15 years 7 months ago
2005
Springer
The Employee Timetabling Problem (ETP) is a general class of problems widely encountered in service organizations (such as call centers for instance). Given a set of activities, a ...
101
click to vote
CDC
2010
IEEE
14 years 8 months ago
2010
IEEE
In this paper we deal with two problems which are of great interest in the field of distributed decision making and control. The first problem we tackle is the problem of achieving...
IAT
2008
IEEE
15 years 8 months ago
2008
IEEE
The process of creating e-learning contents using reusable learning objects (LOs) can be broken down in two sub-processes: LOs finding and LO sequencing. Although semiautomatic to...
121
click to vote
IJCAI
2001
15 years 2 months ago
2001
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...
112
click to vote
RC
2002
15 years 1 months ago
2002
A new method to decide the invertibility of a given high-dimensional function over a domain is presented. The problem arises in the field of verified solution of differential algeb...