Sciweavers

220 search results - page 30 / 44
» Saturated models of universal theories
Sort
View
CCR
2004
62views more  CCR 2004»
13 years 7 months ago
Methodological frameworks for large-scale network analysis and design
This paper emphasizes the need for methodological frameworks for analysis and design of large scale networks which are independent of specific design innovations and their advocac...
Antonis Papachristodoulou, Lun Li, John C. Doyle
PODC
2006
ACM
14 years 1 months ago
Quorum placement in networks: minimizing network congestion
A quorum system over a universe of logical elements is a collection of subsets (quorums) of elements, any two of which intersect. In numerous distributed algorithms, the elements ...
Daniel Golovin, Anupam Gupta, Bruce M. Maggs, Flor...
STOC
2012
ACM
251views Algorithms» more  STOC 2012»
11 years 9 months ago
Minimax option pricing meets black-scholes in the limit
Option contracts are a type of financial derivative that allow investors to hedge risk and speculate on the variation of an asset’s future market price. In short, an option has...
Jacob Abernethy, Rafael M. Frongillo, Andre Wibiso...
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
14 years 17 days 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
TLDI
2009
ACM
169views Formal Methods» more  TLDI 2009»
14 years 4 months ago
Relational parametricity for references and recursive types
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
Lars Birkedal, Kristian Støvring, Jacob Tha...