Sciweavers

914 search results - page 180 / 183
» The Computational Complexity of Probabilistic Planning
Sort
View
SIGMOD
2007
ACM
219views Database» more  SIGMOD 2007»
14 years 9 months ago
Efficient exploitation of similar subexpressions for query processing
Complex queries often contain common or similar subexpressions, either within a single query or among multiple queries submitted as a batch. If so, query execution time can be imp...
Jingren Zhou, Johann Christoph Freytag, Per-Å...
ATAL
2009
Springer
14 years 3 months ago
Sensitivity analysis for distributed optimization with resource constraints
Previous work in multiagent coordination has addressed the challenge of planning in domains where agents must optimize a global goal, while satisfying local resource constraints. ...
Emma Bowring, Zhengyu Yin, Rob Zinkov, Milind Tamb...
CPAIOR
2009
Springer
14 years 3 months ago
Optimal Interdiction of Unreactive Markovian Evaders
The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counter-terrorism. In the typical formulation of network interdi...
Alexander Gutfraind, Aric A. Hagberg, Feng Pan
IMC
2009
ACM
14 years 3 months ago
Characterizing VLAN-induced sharing in a campus network
Many enterprise, campus, and data-center networks have complex layer-2 virtual LANs (“VLANs”) below the IP layer. The interaction between layer-2 and IP topologies in these VL...
Muhammad Mukarram Bin Tariq, Ahmed Mansy, Nick Fea...
HIKM
2006
ACM
14 years 2 months ago
Epoch: an ontological framework to support clinical trials management
The increasing complexity of clinical trials has generated an enormous requirement for knowledge and information specification at all stages of the trials, including planning, doc...
Ravi D. Shankar, Susana B. Martins, Martin J. O'Co...