5962 search results - page 1035 / 1193 » Efficient Clustering for Orders |
143
click to vote
SAC
2008
ACM
15 years 6 months ago
2008
ACM
se a new abstraction for pointer analysis that represents reads and writes to memory instead of traditional points-to relations. Compared to points-to graphs, our Assign-Fetch Gra...
178
click to vote
SAC
2008
ACM
15 years 6 months ago
2008
ACM
In this paper, we focus on an aspect of distributed XQuery processing that involves data exchanges between processor elements. We first address problems of distributed XML query p...
202
click to vote
TSC
2008
15 years 6 months ago
2008
This paper studies the dynamic Web service selection problem in a failure-prone environment, which aims to determine a subset of Web services to be invoked at runtime so as to succ...
188
click to vote
VLC
2008
15 years 6 months ago
2008
In order to evaluate automated image annotation and object recognition algorithms, ground truth in the form of a set of images correctly annotated with text describing each image ...
192
click to vote
HEURISTICS
2008
15 years 5 months ago
2008
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...