784 search results - page 11 / 157 » Relaxing the Value Restriction |
ICCD
2003
IEEE
14 years 4 months ago
2003
IEEE
This paper presents a pinpoint test set relaxation method for test compression that maximally derives the capability of a run-length encoding technique such as Golomb coding or fr...
ECAI
2000
Springer
14 years 2 days ago
2000
Springer
Abstract. Scheduling meetings is generally difficult in that it attempts to satisfy the preferences of all participants. However, all participants can agree to a schedule in which...
COR
2006
13 years 7 months ago
2006
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
ISCAS
2005
IEEE
14 years 1 months ago
2005
IEEE
— This paper introduces a heuristic solution to the multiple restricted multiplication (MRM) optimization problem. MRM refers to a situation where a single variable is multiplied...
DLOG
2001
13 years 9 months ago
2001
We consider expressive Description Logics (ALCN) allowing for number restrictions on complex roles built with combinations of role constructors. In particular, we are mainly inter...