Sciweavers

1439 search results - page 228 / 288
» Bagging with Adaptive Costs
Sort
View
AIPS
2006
13 years 11 months ago
Sequential Monte Carlo in Probabilistic Planning Reachability Heuristics
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
Daniel Bryce, Subbarao Kambhampati, David E. Smith
FAST
2004
13 years 11 months ago
Diamond: A Storage Architecture for Early Discard in Interactive Search
This paper explores the concept of early discard for interactive search of unindexed data. Processing data inside storage devices using downloaded searchlet code enables Diamond t...
Larry Huston, Rahul Sukthankar, Rajiv Wickremesing...
ICINCO
2004
122views Robotics» more  ICINCO 2004»
13 years 11 months ago
Data Security Considerations in Modern Automation Networks
: The automation manufacturing business has reached its turning point and manufacturers are forced to create new business areas. Their expertise about field devices will be the sou...
Mikko Salmenperä, Jari Seppälä
BDA
2003
13 years 11 months ago
Memory Requirements for Query Execution in Highly Constrained Devices
Pervasive computing introduces data management requirements that must be tackled in a growingvariety of lightweight computing devices. Personal folders on chip, networks of sensor...
Nicolas Anciaux, Luc Bouganim, Philippe Pucheral
CIC
2003
140views Communications» more  CIC 2003»
13 years 11 months ago
Magic Square: Scalable Peer-to-Peer Lookup Protocol Considering Peer's Characteristics
One of the research problems in P2P computing is to look up and store the resource efficiently. The recent algorithms developed by several research groups for the lookup problem p...
Sun-Mi Park, Il-dong Jung, Dong-joo Song, Young-su...