Sciweavers

1295 search results - page 78 / 259
» Palimpsests of Time and Place
Sort
View
SODA
2001
ACM
93views Algorithms» more  SODA 2001»
15 years 1 months ago
Making data structures confluently persistent
We address a longstanding open problem of [11, 10], and present a general transformation that transforms any pointer based data structure to be confluently persistent. Such transf...
Amos Fiat, Haim Kaplan
WOA
2007
15 years 1 months ago
Expectations driven approach for Situated, Goal-directed Agents
Abstract— Situated agents engaged in open systems continually face with external events requiring adequate services and behavioral responses. In these conditions agents should be...
Michele Piunti, Cristiano Castelfranchi, Rino Falc...
IJSNET
2008
125views more  IJSNET 2008»
14 years 12 months ago
Minimum-cost sensor arrangement for achieving wanted coverage lifetime
: Suppose we need to watch a set of targets continuously for a required period of time, and suppose we choose any number of sensors from a fixed set of sensor types and place them ...
Jie Wang, Ning Zhong
JCP
2008
216views more  JCP 2008»
14 years 12 months ago
Design Overview Of Processor Based Implantable Pacemaker
Implantable pacemaker is a battery operated real time embedded system, which includes software/hardware codesign strategy. As it is placed within the heart by surgery, battery life...
Santosh D. Chede, Kishore D. Kulat
ENTCS
2002
90views more  ENTCS 2002»
14 years 11 months ago
Inorder traversal of splay trees
Splay trees, a form of self-adjusting binary tree, were introduced by Sleator and Tarjan in the early 1980s. Their main use is to store ordered lists. The idea is to keep the tree...
Colm Ó'Dúnlaing