Sciweavers

1322 search results - page 230 / 265
» Parameterized counting problems
Sort
View
LOBJET
2006
127views more  LOBJET 2006»
13 years 10 months ago
A Definition, Overview and Taxonomy of Generic Aspect Languages
ABSTRACT. Aspect-orientation promises better modularity than pure object-oriented decomposition. A typical benefit of increased modularity is ease of maintenance, evolution and reu...
Günter Kniesel, Tobias Rho
IJRR
2007
104views more  IJRR 2007»
13 years 9 months ago
Deep Space Formation Flying Spacecraft Path Planning
Efficient algorithms for collision-free energy sub-optimal path planning for formations of spacecraft flying in deep space are presented. The idea is to introduce a set of way-poi...
Cornel Sultan, Sanjeev Seereeram, Raman K. Mehra
JMLR
2010
148views more  JMLR 2010»
13 years 4 months ago
A Generalized Path Integral Control Approach to Reinforcement Learning
With the goal to generate more scalable algorithms with higher efficiency and fewer open parameters, reinforcement learning (RL) has recently moved towards combining classical tec...
Evangelos Theodorou, Jonas Buchli, Stefan Schaal
RTAS
2009
IEEE
14 years 4 months ago
Lightweight Modeling of Complex State Dependencies in Stream Processing Systems
Over the last few years, Real-Time Calculus has been used extensively to model and analyze embedded systems processing continuous data/event streams. Towards this, bounds on the a...
Anne Bouillard, Linh T. X. Phan, Samarjit Chakrabo...
COMPGEOM
2009
ACM
14 years 4 months ago
Proximity of persistence modules and their diagrams
Topological persistence has proven to be a key concept for the study of real-valued functions defined over topological spaces. Its validity relies on the fundamental property tha...
Frédéric Chazal, David Cohen-Steiner...