Sciweavers

2018 search results - page 24 / 404
» Code Normal Forms
Sort
View
COLING
2010
13 years 4 months ago
Normal-form parsing for Combinatory Categorial Grammars with generalized composition and type-raising
We propose and implement a modification of the Eisner (1996) normal form to account for generalized composition of bounded degree, and an extension to deal with grammatical type-r...
Julia Hockenmaier, Yonatan Bisk
SODA
2008
ACM
134views Algorithms» more  SODA 2008»
13 years 11 months ago
Fast algorithms for finding proper strategies in game trees
We show how to find a normal form proper equilibrium in behavior strategies of a given two-player zero-sum extensive form game with imperfect information but perfect recall. Our a...
Peter Bro Miltersen, Troels Bjerre Sørensen
MFCS
1997
Springer
14 years 2 months ago
When are Two Rewrite Systems More than None?
It is important for programs to have modular correctness properties. We look at non-deterministic programs expressed as termrewriting systems which compute normal forms of input t...
Nachum Dershowitz
AIPS
2009
13 years 11 months ago
A Conformant Planner with Explicit Disjunctive Representation of Belief States
This paper describes a novel and competitive complete conformant planner. Key to the enhanced performance is an efficient encoding of belief states as disjunctive normal form form...
Son Thanh To, Enrico Pontelli, Tran Cao Son
MICRO
1995
IEEE
125views Hardware» more  MICRO 1995»
14 years 1 months ago
Disjoint eager execution: an optimal form of speculative execution
Instruction Level Parallelism (ILP) speedups of an order-of-magnitude or greater may be possible using the techniques described herein. Traditional speculative code execution is t...
Augustus K. Uht, Vijay Sindagi, Kelley Hall