Sciweavers

44 search results - page 7 / 9
» A Complete Anytime Algorithm for Number Partitioning
Sort
View
XSYM
2009
Springer
139views Database» more  XSYM 2009»
14 years 2 months ago
A Data Parallel Algorithm for XML DOM Parsing
Abstract. The extensible markup language XML has become the de facto standard for information representation and interchange on the Internet. XML parsing is a core operation perfor...
Bhavik Shah, Praveen Rao, Bongki Moon, Mohan Rajag...
FOCS
2003
IEEE
14 years 1 months ago
Clustering with Qualitative Information
We consider the problem of clustering a collection of elements based on pairwise judgments of similarity and dissimilarity. Bansal, Blum and Chawla (in: Proceedings of 43rd FOCS, ...
Moses Charikar, Venkatesan Guruswami, Anthony Wirt...
STOC
2003
ACM
90views Algorithms» more  STOC 2003»
14 years 8 months ago
Work-competitive scheduling for cooperative computing with dynamic groups
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
Chryssis Georgiou, Alexander Russell, Alexander A....
ISSRE
2007
IEEE
13 years 9 months ago
Generating Trace-Sets for Model-based Testing
Model-checkers are powerful tools that can find individual traces through models to satisfy desired properties. These traces provide solutions to a number of problems. Instead of...
Birgitta Lindström, Paul Pettersson, Jeff Off...
AAAI
1996
13 years 9 months ago
Improved Limited Discrepancy Search
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
Richard E. Korf