1208 search results - page 169 / 242 » Uniform eventown problems |
137
click to vote
ICLP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In recent work, a general framework for specifying program correspondences under the answer-set semantics has been defined. The framework allows to define different not...
150
click to vote
ISAAC
2005
Springer
15 years 10 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
133
click to vote
WABI
2005
Springer
15 years 10 months ago
2005
Springer
We give a new algorithm for the genotype phasing problem. Our solution is based on a hidden Markov model for haplotypes. The model has a uniform structure, unlike most solutions pr...
151
click to vote
MSWIM
2004
ACM
15 years 10 months ago
2004
ACM
This study addresses the problem of k-connectivity of a wireless multihop network consisting of randomly placed nodes with a common transmission range, by utilizing empirical regr...
133
click to vote
PODC
2004
ACM
15 years 10 months ago
2004
ACM
We explore the computational power of networks of small resource-limited mobile agents. We define two new models of computation based on pairwise interactions of finite-state ag...