Sciweavers

1263 search results - page 209 / 253
» A* with Bounded Costs
Sort
View
TC
2002
13 years 7 months ago
Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks
We present novel grid coverage strategies for effective surveillance and target location in distributed sensor networks. We represent the sensor field as a grid (two or three-dimen...
Krishnendu Chakrabarty, S. Sitharama Iyengar, Hair...
MOR
2007
149views more  MOR 2007»
13 years 7 months ago
LP Rounding Approximation Algorithms for Stochastic Network Design
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
Anupam Gupta, R. Ravi, Amitabh Sinha
IOR
2010
90views more  IOR 2010»
13 years 6 months ago
No-Holdback Allocation Rules for Continuous-Time Assemble-to-Order Systems
This paper analyzes a class of common-component allocation rules, termed no-holdback (NHB) rules, in continuous-review assemble-to-order (ATO) systems. We assume that component in...
Yingdong Lu, Jing-Sheng Song, Yao Zhao
SIGIR
2008
ACM
13 years 6 months ago
ResIn: a combination of results caching and index pruning for high-performance web search engines
Results caching is an efficient technique for reducing the query processing load, hence it is commonly used in real search engines. This technique, however, bounds the maximum hit...
Gleb Skobeltsyn, Flavio Junqueira, Vassilis Placho...
IWSEC
2010
Springer
13 years 6 months ago
Optimal Adversary Behavior for the Serial Model of Financial Attack Trees
Abstract. Attack tree analysis is used to estimate different parameters of general security threats based on information available for atomic subthreats. We focus on estimating the...
Margus Niitsoo