Sciweavers

3367 search results - page 199 / 674
» Incremental assignment problem
Sort
View
126
Voted
ACL
1994
15 years 4 months ago
A Psycholinguistically Motivated Parser for CCG
Considering the speed in which humans resolve syntactic ambiguity, and the overwhelming evidence that syntactic ambiguity is resolved through selection of the analysis whose inter...
Michael Niv
125
Voted
COGSCI
2002
83views more  COGSCI 2002»
15 years 3 months ago
Strategies in sentential reasoning
Four experiments examined the strategies that individuals develop in sentential reasoning. They led to the discovery of five different strategies. According to the theory proposed...
Jean-Baptiste Van der Henst, Yingrui Yang, Philip ...
128
Voted
CCCG
2001
15 years 4 months ago
Translational polygon covering using intersection graphs
We investigate the following translational 2D polygon covering problem: for a collection of covering polygons and a target point (or polygon) set, decide if the covering polygons ...
Karen Daniels, Rajasekhar Inkulu
CORR
2007
Springer
75views Education» more  CORR 2007»
15 years 3 months ago
Polyhedral representation conversion up to symmetries
We give a short survey on computational techniques which can be used to solve the representation conversion problem for polyhedra up to symmetries. In particular we discuss decompo...
David Bremner, Mathieu Dutour Sikiric, Achill Sch&...
ACMSE
2010
ACM
15 years 1 months ago
Generating three binary addition algorithms using reinforcement programming
Reinforcement Programming (RP) is a new technique for automatically generating a computer program using reinforcement learning methods. This paper describes how RP learned to gene...
Spencer K. White, Tony R. Martinez, George L. Rudo...