Sciweavers

10608 search results - page 270 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
101
Voted
JC
2007
101views more  JC 2007»
15 years 13 days ago
Simple Monte Carlo and the Metropolis algorithm
We study the integration of functions with respect to an unknown density. Information is available as oracle calls to the integrand and to the nonnormalized density function. We ar...
Peter Mathé, Erich Novak
TON
2010
125views more  TON 2010»
14 years 7 months ago
Computational analysis and efficient algorithms for micro and macro OFDMA downlink scheduling
OFDMA is one of the most important modulation and access methods for the future mobile networks. Before transmitting a frame on the downlink, an OFDMA base station has to invoke an...
Reuven Cohen, Liran Katzir
103
Voted
JCPHY
2011
87views more  JCPHY 2011»
14 years 3 months ago
A fast directional algorithm for high-frequency electromagnetic scattering
This paper is concerned with the fast solution of high frequency electromagnetic scattering problems using the boundary integral formulation. We extend the O(N log N) directional ...
Paul Tsuji, Lexing Ying
102
Voted
ICALP
2000
Springer
15 years 4 months ago
An Optimal Minimum Spanning Tree Algorithm
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
Seth Pettie, Vijaya Ramachandran
WSC
2008
15 years 2 months ago
A simulation based optimization algorithm for slack reduction and workforce scheduling
In an assembly line with high labor proportion, the workforce planning and scheduling is a very complex problem. At the background of increasing labor costs, it is very important ...
Daniel Noack, Oliver Rose