Sciweavers

1263 search results - page 242 / 253
» A* with Bounded Costs
Sort
View
NSDI
2008
13 years 10 months ago
Ostra: Leveraging Trust to Thwart Unwanted Communication
Online communication media such as email, instant messaging, bulletin boards, voice-over-IP, and social networking sites allow any sender to reach potentially millions of users at...
Alan Mislove, Ansley Post, Peter Druschel, P. Kris...
CASES
2005
ACM
13 years 10 months ago
MTSS: multi task stack sharing for embedded systems
Out-of-memory errors are a serious source of unreliability in most embedded systems [22]. Applications run out of main memory because of the frequent difficulty of estimating the ...
Bhuvan Middha, Matthew Simpson, Rajeev Barua
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
13 years 10 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
CPM
2008
Springer
134views Combinatorics» more  CPM 2008»
13 years 9 months ago
An Improved Succinct Representation for Dynamic k-ary Trees
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
Diego Arroyuelo
AAAI
2010
13 years 9 months ago
Multi-Agent Plan Recognition: Formalization and Algorithms
Multi-Agent Plan Recognition (MAPR) seeks to identify the dynamic team structures and team behaviors from the observations of the activity-sequences of a set of intelligent agents...
Bikramjit Banerjee, Landon Kraemer, Jeremy Lyle