Sciweavers

1837 search results - page 281 / 368
» Abstraction and the C Machine Model
Sort
View
ROBOCUP
2000
Springer
120views Robotics» more  ROBOCUP 2000»
14 years 16 days ago
Towards a Logical Approach for Soccer Agents Engineering
Building agents for a scenario such as the RoboCup simulation league requires not only methodologies for implementing high-level complex behavior, but also the careful and efficien...
Jan Murray, Oliver Obst, Frieder Stolzenburg
PPOPP
1995
ACM
14 years 15 days ago
Optimistic Active Messages: A Mechanism for Scheduling Communication with Computation
Low-overhead message passing is critical to the performance of many applications. Active Messages[27] reduce the software overhead for message handling: messages are run as handle...
Deborah A. Wallach, Wilson C. Hsieh, Kirk L. Johns...
EDBT
2008
ACM
146views Database» more  EDBT 2008»
13 years 10 months ago
SPARQLing constraints for RDF
The goal of the Semantic Web is to support semantic interoperability between applications exchanging data on the web. The idea heavily relies on data being made available in machi...
Georg Lausen, Michael Meier 0002, Michael Schmidt
MST
1998
76views more  MST 1998»
13 years 8 months ago
Sharply Bounded Alternation and Quasilinear Time
We de ne the sharply bounded hierarchy, SBH(QL), a hierarchy of classes within P, using quasilinear-time computation and quanti cation over strings of length logn. It generalizes ...
Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith
CDC
2010
IEEE
196views Control Systems» more  CDC 2010»
13 years 4 months ago
Convergence and convergence rate of stochastic gradient search in the case of multiple and non-isolated extrema
The asymptotic behavior of stochastic gradient algorithms is studied. Relying on some results of differential geometry (Lojasiewicz gradient inequality), the almost sure pointconve...
Vladislav B. Tadic