4903 search results - page 42 / 981 » The Set Covering Machine |
ISMVL
2009
IEEE
14 years 3 months ago
2009
IEEE
A partial function f on an k-element set Ek is a partial Sheffer function if every partial function on Ek is definable in terms of f. Since this holds if and only if f belongs to...
EUROMICRO
1999
IEEE
14 years 1 months ago
1999
IEEE
COCO
1989
Springer
14 years 1 months ago
1989
Springer
TIT
2008
13 years 9 months ago
2008
The identifying code problem for a given graph involves finding a minimum set of vertices whose neighborhoods uniquely overlap at any given graph vertex. Initially introduced in 1...
BPM
2008
Springer
13 years 11 months ago
2008
Springer
We present a finite representation of all services M where the composition with a given service N is deadlock-free, and a given set of activities of N can be covered (i.e. is not d...