Sciweavers

1132 search results - page 178 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
INFOCOM
1998
IEEE
15 years 10 months ago
Design of Logical Topologies: A Linear Formulation for Wavelength Routed Optical Networks with No Wavelength Changers
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...
Rajesh M. Krishnaswamy, Kumar N. Sivarajan
TSP
2008
132views more  TSP 2008»
15 years 6 months ago
Differential Modulations for Multinode Cooperative Communications
Abstract--This paper proposes and analyzes differential modulation schemes for two cooperation protocols in multinode cooperative wireless networks; namely, multinode differential ...
Thanongsak Himsoon, W. Pam Siriwongpairat, Weifeng...
ECCC
2011
207views ECommerce» more  ECCC 2011»
15 years 1 months ago
Balls and Bins: Smaller Hash Families and Faster Evaluation
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wied...
COMPGEOM
2007
ACM
15 years 8 months ago
Between umbra and penumbra
Computing shadow boundaries is a difficult problem in the case of non-point light sources. A point is in the umbra if it does not see any part of any light source; it is in full l...
Julien Demouth, Olivier Devillers, Hazel Everett, ...
IJCAI
2007
15 years 7 months ago
A Game-Theoretic Analysis of Strictly Competitive Multiagent Scenarios
This paper is a comparative study of game-theoretic solution concepts in strictly competitive multiagent scenarios, as commonly encountered in the context of parlor games, competi...
Felix Brandt, Felix A. Fischer, Paul Harrenstein, ...