Sökning: onr:"swepub:oai:DiVA.org:ri-22014" >
Pruning for the min...
Pruning for the minimum Constraint Family and for the Number of Distinct Values Constraint Family
-
- Beldiceanu, Nicolas (författare)
- RISE,SICS
-
(creator_code:org_t)
- 1
- Kista, Sweden : Swedish Institute of Computer Science, 2000
- Engelska 18 s.
-
Serie: SICS Technical Report, 1100-3154 ; T2000:10
- Relaterad länk:
-
https://ri.diva-port... (primary) (Raw object)
-
visa fler...
-
https://urn.kb.se/re...
-
visa färre...
Abstract
Ämnesord
Stäng
- The paper presents propagation rules that are common to the minimum constraint family and to the number of distinct values constraint family. One original contribution is to provide a geometrical interpretation of these rules that can be used by a generic sweep pruning algorithm. Finally one practical interest of the paper is to describe an implementation of the number of distinct values constraint. This is a quite common counting constraint that one encounters in many practical applications such as timetabling or frequency allocation problems.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences (hsv//eng)
Nyckelord
- Global constraint
- Minimum
- Number of distinct values
Publikations- och innehållstyp
- vet (ämneskategori)
- rap (ämneskategori)