1568 search results - page 162 / 314 » The problem of examination questions in algorithmics |
173
click to vote
IJCAI
2003
15 years 7 months ago
2003
We examine the approach of encoding planning problems as CSPs more closely. First we present a simple CSP encoding for planning problems and then a set of transformations that can...
170
click to vote
IJAR
2006
15 years 6 months ago
2006
In many real-life situations, we know the probability distribution of two random variables x1 and x2, but we have no information about the correlation between x1 and x2; what are ...
209
click to vote
PODC
2012
ACM
13 years 8 months ago
2012
ACM
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
141
click to vote
APPROX
2005
Springer
15 years 12 months ago
2005
Springer
Traditionally, a fundamental assumption in evaluating the performance of algorithms for sorting and selection has been that comparing any two elements costs one unit (of time, work...
141
click to vote
PODC
2003
ACM
15 years 11 months ago
2003
ACM
Consider a dynamic, large-scale communication infrastructure (e.g., the Internet) where nodes (e.g., in a peer to peer system) can communicate only with nodes whose id (e.g., IP a...