Sciweavers

107 search results - page 12 / 22
» Counting with rational generating functions
Sort
View
JUCS
2008
140views more  JUCS 2008»
13 years 8 months ago
The Computable Multi-Functions on Multi-represented Sets are Closed under Programming
: In the representation approach to computable analysis (TTE) [Grz55, i00], abstract data like rational numbers, real numbers, compact sets or continuous real functions are represe...
Klaus Weihrauch
CSCLP
2008
Springer
13 years 10 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
COMBINATORICS
2000
72views more  COMBINATORICS 2000»
13 years 8 months ago
Tournament Sequences and Meeussen Sequences
A tournament sequence is an increasing sequence of positive integers (t1, t2, . . .) such that t1 = 1 and ti+1 2ti. A Meeussen sequence is an increasing sequence of positive inte...
Matthew Cook, Michael Kleber
CADE
2009
Springer
14 years 3 months ago
Interpolant Generation for UTVPI
Abstract. The problem of computing Craig interpolants in SMT has recently received a lot of interest, mainly for its applications in formal verification. Efficient algorithms for ...
Alessandro Cimatti, Alberto Griggio, Roberto Sebas...
NIPS
2008
13 years 10 months ago
Bayesian Model of Behaviour in Economic Games
Classical game theoretic approaches that make strong rationality assumptions have difficulty modeling human behaviour in economic games. We investigate the role of finite levels o...
Debajyoti Ray, Brooks King-Casas, P. Read Montague...