Sciweavers

7200 search results - page 1176 / 1440
» On the Computational Power of Winner-Take-All
Sort
View
115
Voted
CHARME
2003
Springer
196views Hardware» more  CHARME 2003»
15 years 6 months ago
Analyzing the Intel Itanium Memory Ordering Rules Using Logic Programming and SAT
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
Yue Yang, Ganesh Gopalakrishnan, Gary Lindstrom, K...
ECOOP
2003
Springer
15 years 6 months ago
A Calculus of Untyped Aspect-Oriented Programs
Abstract. Aspects have emerged as a powerful tool in the design and development of systems, allowing for the encapsulation of program transformations. The dynamic semantics of aspe...
Radha Jagadeesan, Alan Jeffrey, James Riely
91
Voted
FOSSACS
2003
Springer
15 years 6 months ago
Generalized Iteration and Coiteration for Higher-Order Nested Datatypes
Abstract. We solve the problem of extending Bird and Paterson’s generalized folds for nested datatypes and its dual to inductive and coinductive constructors of arbitrarily high ...
Andreas Abel, Ralph Matthes, Tarmo Uustalu
ICVS
2003
Springer
15 years 6 months ago
A Framework for Visual Servoing
We consider typical manipulation tasks in terms of a service robot framework. Given a task at hand, such as ”Pick up the cup from the dinner table”, we present a number of diff...
Danica Kragic, Henrik I. Christensen
WEA
2010
Springer
281views Algorithms» more  WEA 2010»
15 years 5 months ago
Distributed Time-Dependent Contraction Hierarchies
Server based route planning in road networks is now powerful enough to find quickest paths in a matter of milliseconds, even if detailed information on time-dependent travel times...
Tim Kieritz, Dennis Luxen, Peter Sanders, Christia...
« Prev « First page 1176 / 1440 Last » Next »