Sciweavers

2911 search results - page 389 / 583
» A Theory of Expressiveness in Mechanisms
Sort
View
SAS
2001
Springer
117views Formal Methods» more  SAS 2001»
15 years 6 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
111
Voted
IJCNN
2000
IEEE
15 years 6 months ago
Robust Adaptive Critic Based Neurocontrollers for Systems with Input Uncertainties
A two-neural network approach to solving nonlinear optimal control problems is described in this study. This approach called the adaptive critic method consists of one neural netw...
Zhongwu Huang, S. N. Balakrishnan
ICFP
2000
ACM
15 years 6 months ago
Intersection types and computational effects
We show that standard formulations of intersection type systems are unsound in the presence of computational effects, and propose a solution similar to the value restriction for ...
Rowan Davies, Frank Pfenning
SIGGRAPH
1999
ACM
15 years 6 months ago
Voice Puppetry
We introduce a method for predicting a control signal from another related signal, and apply it to voice puppetry: Generating full facial animation from expressive information in ...
Matthew Brand
FOCS
1998
IEEE
15 years 6 months ago
A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
John C. Mitchell, Mark Mitchell, Andre Scedrov