Sciweavers

11397 search results - page 50 / 2280
» A Relational Abstraction for Functions
Sort
View
CG
2000
Springer
14 years 2 months ago
Chess Neighborhoods, Function Combination, and Reinforcement Learning
Abstract. Over the years, various research projects have attempted to develop a chess program that learns to play well given little prior knowledge beyond the rules of the game. Ea...
Robert Levinson, Ryan Weber
ISAAC
2009
Springer
98views Algorithms» more  ISAAC 2009»
14 years 4 months ago
On the Tightness of the Buhrman-Cleve-Wigderson Simulation
Abstract. Buhrman, Cleve and Wigderson gave a general communication protocol for block-composed functions f(g1(x1 , y1 ), · · · , gn(xn , yn )) by simulating a decision tree com...
Shengyu Zhang
JCT
2010
144views more  JCT 2010»
13 years 8 months ago
Combinatorics of generalized q-Euler numbers
Abstract. New enumerating functions for the Euler numbers are considered. Several of the relevant generating functions appear in connection to entries in Ramanujan’s Lost Noteboo...
Tim Huber, Ae Ja Yee
APLAS
2011
ACM
12 years 10 months ago
Solving Recursion-Free Horn Clauses over LI+UIF
Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively auusing abstraction and refinement schemes that rely o...
Ashutosh Gupta, Corneliu Popeea, Andrey Rybalchenk...
IFL
1998
Springer
139views Formal Methods» more  IFL 1998»
14 years 2 months ago
Higher Order Demand Propagation
Abstract. In this report a new backward strictness analysis for functional languages is presented. It is called higher order demand propagation and is applicable to a realistic non...
Dirk Pape