Sciweavers

349 search results - page 61 / 70
» Recursive Path Orderings Can Also Be Incremental
Sort
View
HASKELL
2008
ACM
13 years 8 months ago
Lightweight monadic regions
We present Haskell libraries that statically ensure the safe use of resources such as file handles. We statically prevent accessing an already closed handle or forgetting to clos...
Oleg Kiselyov, Chung-chieh Shan
TMC
2008
107views more  TMC 2008»
13 years 7 months ago
A Mutual Network Synchronization Method for Wireless Ad Hoc and Sensor Networks
Mutual network synchronization is a distributed method in which geographically separated clocks align their times to one another without the need of reference or master clocks. Mut...
Carlos H. Rentel, Thomas Kunz
ISCA
1999
IEEE
104views Hardware» more  ISCA 1999»
13 years 11 months ago
Is SC + ILP=RC?
Sequential consistency (SC) is the simplest programming interface for shared-memory systems but imposes program order among all memory operations, possibly precluding high perform...
Chris Gniady, Babak Falsafi, T. N. Vijaykumar
RSA
2010
107views more  RSA 2010»
13 years 5 months ago
Continuum limits for classical sequential growth models
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
Graham Brightwell, Nicholas Georgiou
ISRR
2005
Springer
154views Robotics» more  ISRR 2005»
14 years 1 months ago
Session Overview Planning
ys when planning meant searching for a sequence of abstract actions that satisfied some symbolic predicate. Robots can now learn their own representations through statistical infe...
Nicholas Roy, Roland Siegwart