Sciweavers

98 search results - page 19 / 20
» A Class of stochastic programs with decision dependent uncer...
Sort
View
LICS
2009
IEEE
14 years 1 months ago
Functional Reachability
—What is reachability in higher-order functional programs? We formulate reachability as a decision problem in the setting of the prototypical functional language PCF, and show th...
C.-H. Luke Ong, Nikos Tzevelekos
CONEXT
2008
ACM
13 years 9 months ago
On cooperative settlement between content, transit and eyeball internet service providers
Internet service providers (ISPs) depend on one another to provide global network services. However, the profit-seeking nature of the ISPs leads to selfish behaviors that result i...
Richard T. B. Ma, Dah-Ming Chiu, John C. S. Lui, V...
TSP
2010
13 years 2 months ago
MIMO transceiver optimization with linear constraints on transmitted signal covariance components
Abstract--This correspondence revisits the joint transceiver optimization problem for multiple-input multiple-output (MIMO) channels. The linear transceiver as well as the transcei...
Ching-Chih Weng, P. P. Vaidyanathan
SIAMCOMP
2010
174views more  SIAMCOMP 2010»
13 years 5 months ago
On the Complexity of Nash Equilibria and Other Fixed Points
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
Kousha Etessami, Mihalis Yannakakis
CSFW
2009
IEEE
14 years 2 months ago
More Anonymous Onion Routing Through Trust
We consider using trust information to improve the anonymity provided by onion-routing networks. In particular, we introduce a model of trust in network nodes and use it to design...
Aaron Johnson, Paul F. Syverson