966 search results - page 126 / 194 » Communicating Answer Set Programs |
134
click to vote
WABI
2009
Springer
15 years 11 months ago
2009
Springer
Background: Supertree methods combine the phylogenetic information from multiple partially-overlapping trees into a larger phylogenetic tree called a supertree. Several supertree ...
145
click to vote
COMPGEOM
2003
ACM
15 years 10 months ago
2003
ACM
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
117
click to vote
PODS
2010
ACM
15 years 9 months ago
2010
ACM
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
135
click to vote
PODC
2005
ACM
15 years 10 months ago
2005
ACM
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
204
click to vote
GPC
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Large-scale distributed computing applications require concurrent programming models that support modular and compositional software development. The actor model supports...