74 search results - page 11 / 15 » Experimentation with bounded buffer synchronization |
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
Distributed constraint optimization problems (DCOPs) are a popular way of formulating and solving agent-coordination problems. It is often desirable to solve DCOPs optimally with m...
PPOPP
2006
ACM
14 years 1 months ago
2006
ACM
Applications need to become more concurrent to take advantage of the increased computational power provided by chip level multiprocessing. Programmers have traditionally managed t...
DEBS
2003
ACM
14 years 1 months ago
2003
ACM
Event-based computing is vital for the next generation mobile services and applications that need to meet user requirements irrespective of time and location. The event paradigm i...
KDD
2008
ACM
14 years 8 months ago
2008
ACM
Recent years have witnessed increased interest in computing strongly correlated pairs in very large databases. Most previous studies have been focused on static data sets. However...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...