Sciweavers

216 search results - page 37 / 44
» On the number of minima of a random polynomial
Sort
View
PODC
1990
ACM
13 years 11 months ago
Sharing Memory Robustly in Message-Passing Systems
Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, singl...
Hagit Attiya, Amotz Bar-Noy, Danny Dolev
SODA
1996
ACM
95views Algorithms» more  SODA 1996»
13 years 9 months ago
RNC Algorithms for the Uniform Generation of Combinatorial Structures
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...
Michele Zito, Ida Pu, Martyn Amos, Alan Gibbons
EOR
2007
69views more  EOR 2007»
13 years 7 months ago
Incorporating inventory and routing costs in strategic location models
We consider a supply chain design problem where the decision maker needs to decide the number and locations of the distribution centers (DCs). Customers face random demand, and ea...
Zuo-Jun Max Shen, Lian Qi
ISCI
1998
91views more  ISCI 1998»
13 years 7 months ago
The Improper Fuzzy Riemann Integral and its Numerical Integration
The improper fuzzy Riemann integral and its numerical integration are proposed in this paper. Under the setting of the improper fuzzy Riemann integral, we can ®nd the expectation...
Hsien-Chung Wu
TIT
2002
121views more  TIT 2002»
13 years 7 months ago
Asymptotic normality of linear multiuser receiver outputs
This paper proves large-system asymptotic normality of the output of a family of linear multiuser receivers that can be arbitrarily well approximated by polynomial receivers. This ...
Dongning Guo, Sergio Verdú, Lars K. Rasmuss...