16843 search results - page 315 / 3369 » On Generalized Authorization Problems |
162
click to vote
AAAI
2006
15 years 8 months ago
2006
We consider the problem of rewriting a query efficiently using materialized views. In the context of information integration, this problem has received significant attention in th...
160
click to vote
SIAMDM
2008
15 years 6 months ago
2008
A well-known theorem of Nash-Williams and Tutte gives a necessary and sufficient condition for the existence of k edge-disjoint spanning trees in an undirected graph. A corollary o...
158
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
Knockout tournaments constitute a common format of sporting events, and also model a specific type of election scheme (namely, sequential pairwise elimination election). In such ...
163
click to vote
CISSE
2009
Springer
15 years 10 months ago
2009
Springer
: We show that estimating the complexity (mean and distribution) of the instances of a fixed size Constraint Satisfaction Problem (CSP) can be very hard. We deal with the main two ...
185
click to vote
LATIN
2000
Springer
15 years 10 months ago
2000
Springer
The Flexible Job Shop problem is a generalization of the classical job shop scheduling problem in which for every operation there is a group of machines that can process it. The p...