This paper studies an extension of the k-median problem where we are given a metric space (V, d) and not just one but m client sets {Si V }m i=1, and the goal is to open k facili...
Barbara M. Anthony, Vineet Goyal, Anupam Gupta, Vi...
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
Daniel Bryce, Subbarao Kambhampati, David E. Smith
Current application-sharing systems support a single architecture for all collaborations, though different systems support different architectures We have developed a system that s...
High-throughput real-time systems require non-standard and costly hardware and software solutions. Modern workstation can represent a credible alternative to develop realtime inte...
Modern databases allow mobile clients that subscribe to replicated data, to process the replica without requiring continuous connectivity, and to receive the updates while connecte...