Sciweavers

1263 search results - page 202 / 253
» A* with Bounded Costs
Sort
View
SODA
2008
ACM
82views Algorithms» more  SODA 2008»
13 years 9 months ago
A plant location guide for the unsure
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...
AIPS
2006
13 years 9 months ago
Sequential Monte Carlo in Probabilistic Planning Reachability Heuristics
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
ECSCW
2001
13 years 9 months ago
Flexible support for application-sharing architecture
Current application-sharing systems support a single architecture for all collaborations, though different systems support different architectures We have developed a system that s...
Goopeel Chung, Prasun Dewan
PDPTA
2004
13 years 9 months ago
Design of a Real-Time Scheduler for Kahn Process Networks on Multiprocessor Systems
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...
Javed Dulloo, Philippe Marquet
WIS
2004
13 years 9 months ago
Pruning Update Log Files in Intermittently Connected Databases
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...
Liton Chakraborty, Ajit Singh, Kshirasagar Naik