Sciweavers

442 search results - page 58 / 89
» Regularization in oculomotor control
Sort
View
AIPS
1998
15 years 3 months ago
Solving Stochastic Planning Problems with Large State and Action Spaces
Planning methods for deterministic planning problems traditionally exploit factored representations to encode the dynamics of problems in terms of a set of parameters, e.g., the l...
Thomas Dean, Robert Givan, Kee-Eung Kim
ADHOC
2010
123views more  ADHOC 2010»
15 years 2 months ago
An analysis of the lifetime of OLSR networks
The Optimized Link State Routing (OLSR) protocol is a well-known route discovery protocol for ad-hoc networks. OLSR optimizes the flooding of link state information through the ne...
Jan-Maarten Verbree, Maurits de Graaf, Johann Huri...
CGF
2006
191views more  CGF 2006»
15 years 2 months ago
A Robust Two-Step Procedure for Quad-Dominant Remeshing
We propose a new technique for quad-dominant remeshing which separates the local regularity requirements from the global alignment requirements by working in two steps. In the fir...
Martin Marinov, Leif Kobbelt
JCSS
2008
90views more  JCSS 2008»
15 years 1 months ago
Fault tolerance in cellular automata at high fault rates
A commonly used model for fault-tolerant computation is that of cellular automata. The essential difficulty of fault-tolerant computation is present in the special case of simply ...
Mark McCann, Nicholas Pippenger
AOSD
2011
ACM
14 years 9 months ago
Closure joinpoints: block joinpoints without surprises
Block joinpoints allow programmers to explicitly mark regions of base code as “to be advised”, thus avoiding the need to extract the block into a method just for the sake of c...
Eric Bodden