10182 search results - page 1990 / 2037 » Case Studies |
108
click to vote
FSTTCS
2008
Springer
15 years 27 days ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
101
click to vote
SPAA
2010
ACM
15 years 23 hour ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
120
click to vote
ICDE
2010
IEEE
15 years 18 hour ago
2010
IEEE
Abstract—In the context of service composition and orchestration, service invocation is typically scheduled according to execution plans, whose topology establishes whether diffe...
108
click to vote
AAI
2007
14 years 12 months ago
2007
In recent years, the KDD process has been advocated to be an iterative and interactive process. It is seldom the case that a user is able to answer immediately with a single query...
125
click to vote
AI
2010
Springer
14 years 12 months ago
2010
Springer
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...