Sciweavers

1175 search results - page 152 / 235
» Abstract computability and algebraic specification
Sort
View
LISP
2008
96views more  LISP 2008»
13 years 9 months ago
Dynamic slicing of lazy functional programs based on redex trails
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
Claudio Ochoa, Josep Silva, Germán Vidal
ICFP
2006
ACM
14 years 9 months ago
Towards an automatic complexity analysis for generic programs
Generic libraries, such as the C++ Standard Template Library (STL), provide flexible, high-performance algorithms and data types, along with functional specifications and performa...
Kyle D. Ross
PERCOM
2007
ACM
14 years 8 months ago
A State-Based Programming Model and System for Wireless Sensor Networks
Sensor networks are one important building block towards the realisation of context-aware applications. Suitable communication protocols and middleware solutions are necessary to ...
Urs Bischoff, Gerd Kortuem
CDC
2010
IEEE
170views Control Systems» more  CDC 2010»
13 years 3 months ago
Motion planning with hybrid dynamics and temporal goals
In this paper, we consider the problem of motion planning for mobile robots with nonlinear hybrid dynamics, and high-level temporal goals. We use a multi-layered synergistic framew...
Amit Bhatia, Lydia E. Kavraki, Moshe Y. Vardi
EXPERT
2006
84views more  EXPERT 2006»
13 years 9 months ago
Infrastructure for Engineered Emergence on Sensor/Actuator Networks
abstraction rules that hide the complexity of systems of components. We've begun this process in the domain of sensor/actuator network applications, observing that in manyappl...
Jacob Beal, Jonathan Bachrach