Sciweavers

150 search results - page 5 / 30
» Parameterized Modal Satisfiability
Sort
View
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
13 years 11 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
ICFEM
2009
Springer
13 years 5 months ago
Graded-CTL: Satisfiability and Symbolic Model Checking
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
Alessandro Ferrante, Margherita Napoli, Mimmo Pare...
ICRA
2010
IEEE
116views Robotics» more  ICRA 2010»
13 years 6 months ago
Parameterized maneuver learning for autonomous helicopter flight
Abstract— Many robotic control tasks involve complex dynamics that are hard to model. Hand-specifying trajectories that satisfy a system’s dynamics can be very time-consuming a...
Jie Tang, Arjun Singh, Nimbus Goehausen, Pieter Ab...
AIML
2008
13 years 9 months ago
Modal logic of time division
A logic LTD is defined, inspired by [37]. It is syntactically like basic modal logic with an additional unary operator but it has an interval-based semantics on structures with arb...
Tero Tulenheimo
CA
2002
IEEE
14 years 13 days ago
Representing and Parameterizing Agent Behaviors
The last few years have seen great maturation in understanding how to use computer graphics technology to portray 3D embodied characters or virtual humans. Unlike the off-line, an...
Norman I. Badler, Jan M. Allbeck, Liwei Zhao, Meer...