2254 search results - page 123 / 451 » Computing the minimal covering set |
103
Voted
CPAIOR
2005
Springer
15 years 6 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 ...
STACS
2007
Springer
15 years 7 months ago
2007
Springer
We consider deducibility constraints, which are equivalent to particular Diophantine systems, arising in the automatic verification of security protocols, in presence of associati...
99
Voted
WWW
2005
ACM
16 years 1 months ago
2005
ACM
With the page explosion of WWW, how to cover more useful information with limited storage and computation resources becomes more and more important in web IR research. Using web p...
94
Voted
COMBINATORICS
2007
15 years 24 days ago
2007
A hypermap is (hypervertex-) bipartite if its hypervertices can be 2-coloured in such a way that “neighbouring” hypervertices have different colours. It is bipartiteuniform i...
101
Voted
NIPS
1998
15 years 2 months ago
1998
Dyadic data refers to a domain with two nite sets of objects in which observations are made for dyads, i.e., pairs with one element from either set. This type of data arises natur...