Sciweavers

1815 search results - page 91 / 363
» Path Planning for Network Performance
Sort
View
CIKM
2009
Springer
15 years 10 months ago
Workload-aware trie indices for XML
Well-designed indices can dramatically improve query performance. Including query workload information can produce indices that yield better overall throughput while balancing the...
Yuqing Wu, Sofia Brenes, Hyungdae Yi
HAIS
2010
Springer
15 years 8 months ago
Incorporating Temporal Constraints in the Planning Task of a Hybrid Intelligent IDS
Abstract. Accurate and swift responses are crucial to Intrusion Detection Systems (IDSs), especially if automatic abortion mechanisms are running. In keeping with this idea, this w...
Álvaro Herrero, Martí Navarro, Vicen...
HASE
2007
IEEE
15 years 9 months ago
SyncProbe: Providing Assurance of Message Latency through Predictive Monitoring of Internet Paths
SyncProbe improves the end-to-end predictability of distributed systems by providing applications with a real-time estimate of the maximum expected message delay (upper bound on c...
Jawwad Shamsi, Monica Brockmeyer
UMUAI
1998
157views more  UMUAI 1998»
15 years 3 months ago
Bayesian Models for Keyhole Plan Recognition in an Adventure Game
We present an approach to keyhole plan recognition which uses a dynamic belief (Bayesian) network to represent features of the domain that are needed to identify users’ plans and...
David W. Albrecht, Ingrid Zukerman, Ann E. Nichols...
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
15 years 8 months ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella