Sciweavers

269 search results - page 16 / 54
» Complexity Theory Made Easy
Sort
View
EMSOFT
2003
Springer
14 years 1 months ago
Schedule-Carrying Code
We introduce the paradigm of schedule-carrying code (SCC). A hard real-time program can be executed on a given platform only if there exists a feasible schedule for the real-time t...
Thomas A. Henzinger, Christoph M. Kirsch, Slobodan...
MC
2001
116views Computer Science» more  MC 2001»
13 years 10 months ago
Emotions and Multimodal Interface-Agents: A Sociological View
Designing human-computer interfaces that are easy and intuitive to use is important for the use of computer technology in general. Due to the growing complexity of information sys...
Daniel Moldt, Christian von Scheve
IANDC
2006
103views more  IANDC 2006»
13 years 8 months ago
Bisimulation and cocongruence for probabilistic systems
We introduce a new notion of bisimulation, called event bisimulation on labelled Markov processes (LMPs) and compare it with the, now standard, notion of probabilistic bisimulatio...
Vincent Danos, Josee Desharnais, François L...
ICRA
2010
IEEE
145views Robotics» more  ICRA 2010»
13 years 7 months ago
Reinforcement learning of motor skills in high dimensions: A path integral approach
— Reinforcement learning (RL) is one of the most general approaches to learning control. Its applicability to complex motor systems, however, has been largely impossible so far d...
Evangelos Theodorou, Jonas Buchli, Stefan Schaal
COMPGEOM
2003
ACM
14 years 1 months ago
Updating and constructing constrained delaunay and constrained regular triangulations by flips
I discuss algorithms based on bistellar flips for inserting and deleting constraining (d − 1)-facets in d-dimensional constrained Delaunay triangulations (CDTs) and weighted CD...
Jonathan Richard Shewchuk