Sciweavers

306 search results - page 30 / 62
» Underspecified computation of normal forms
Sort
View
ACSC
2004
IEEE
14 years 16 days ago
Self-Replicating Expressions in the Lambda Calculus
The study of self-replicating structures in Computer Science has been taking place for more than half a century, motivated by the desire to understand the fundamental principles a...
James Larkin, Phil Stocks
CATS
2007
13 years 10 months ago
Constructing Strictly Positive Families
In order to represent, compute and reason with advanced data types one must go beyond the traditional treatment of data types as being inductive types and, instead, consider them ...
Peter Morris, Thorsten Altenkirch, Neil Ghani
CORR
2007
Springer
99views Education» more  CORR 2007»
13 years 8 months ago
A parametric representation of totally mixed Nash equilibria
We present an algorithm to compute a parametric description of the totally mixed Nash equilibria of a generic game in normal form with a fixed structure. Using this representatio...
Gabriela Jeronimo, Daniel Perrucci, Juan Sabia
CADE
2004
Springer
14 years 9 months ago
Model Checking Using Tabled Rewriting
LRR [3] is a rewriting system developed at the Computer Science Department of University of Houston. LRR has two subsystems: Smaran (for tabled rewriting), and TGR (for untabled re...
Zhiyao Liang
ICPR
2008
IEEE
14 years 3 months ago
Understanding vehicle motion via spatial integration of intensities
On a moving vehicle, speedy motion extraction from video is demanded. Different from the traditional motion estimation methods that track or match 2D features in consecutive motio...
Jiang Yu Zheng, Yasaswy Bhupalam, Hiromi T. Tanaka