14165 search results - page 196 / 2833 » The generalized two-server problem |
164
click to vote
IUI
2004
ACM
15 years 9 months ago
2004
ACM
People are performing increasingly complicated actions on the web, such as automated purchases involving multiple sites. Things often go wrong, however, and it can be difficult to...
128
click to vote
AAAI
2006
15 years 5 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...
123
click to vote
SIAMDM
2008
15 years 4 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...
123
click to vote
ATAL
2009
Springer
15 years 11 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 ...
131
click to vote
CISSE
2009
Springer
15 years 8 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 ...