Sciweavers

1047 search results - page 160 / 210
» Searching Without a Heuristic: Efficient Use of Abstraction
Sort
View
SIGMOD
2008
ACM
188views Database» more  SIGMOD 2008»
14 years 8 months ago
Just-in-time query retrieval over partially indexed data on structured P2P overlays
Structured peer-to-peer (P2P) overlays have been successfully employed in many applications to locate content. However, they have been less effective in handling massive amounts o...
Sai Wu, Jianzhong Li, Beng Chin Ooi, Kian-Lee Tan
EWCBR
2008
Springer
13 years 10 months ago
Real-Time Plan Adaptation for Case-Based Planning in Real-Time Strategy Games
Abstract. Case-based planning (CBP) is based on reusing past successful plans for solving new problems. CBP is particularly useful in environments where the large amount of time re...
Neha Sugandh, Santiago Ontañón, Ashw...
EOR
2010
88views more  EOR 2010»
13 years 8 months ago
Mathematical programming approaches for generating p-efficient points
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...
Miguel A. Lejeune, Nilay Noyan
TC
2008
13 years 8 months ago
DRES: Dynamic Range Encoding Scheme for TCAM Coprocessors
One of the most critical resource management issues in the use of ternary content addressable memory (TCAM) for packet classification/filtering is how to effectively support filte...
Hao Che, Zhijun Wang, Kai Zheng, Bin Liu
OSDI
2000
ACM
13 years 9 months ago
Overcast: Reliable Multicasting with an Overlay Network
Overcast is an application-level multicasting system that can be incrementally deployed using today's Internet infrastructure. These properties stem from Overcast's impl...
John Jannotti, David K. Gifford, Kirk L. Johnson, ...