Sciweavers

1888 search results - page 119 / 378
» Proof theory and computational analysis
Sort
View
FOCS
2005
IEEE
15 years 6 months ago
On the Complexity of Real Functions
We establish a new connection between the two most common traditions in the theory of real computation, the Blum-Shub-Smale model and the Computable Analysis approach. We then use...
Mark Braverman
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 5 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
SOFSEM
2009
Springer
15 years 9 months ago
When Analysis Fails: Heuristic Mechanism Design via Self-correcting Procedures
Abstract. Computational mechanism design (CMD) seeks to understand how to design game forms that induce desirable outcomes in multiagent systems despite private information, self-i...
David C. Parkes
SIGECOM
2005
ACM
93views ECommerce» more  SIGECOM 2005»
15 years 6 months ago
Ranking systems: the PageRank axioms
This paper initiates research on the foundations of ranking systems, a fundamental ingredient of basic e-commerce and Internet Technologies. In order to understand the essence and...
Alon Altman, Moshe Tennenholtz
123
Voted
ACL2
2006
ACM
15 years 6 months ago
An embedding of the ACL2 logic in HOL
We describe an embedding of the ACL2 logic into higherorder logic. An implementation of this embedding allows ACL2 to be used as an oracle for higher-order logic provers. Categori...
Michael J. C. Gordon, Warren A. Hunt Jr., Matt Kau...