Sciweavers

2485 search results - page 54 / 497
» Time Bounded Frequency Computations
Sort
View
IPPS
2005
IEEE
14 years 3 months ago
Processor Allocation for Tasks that is Robust Against Errors in Computation Time Estimates
Heterogeneous computing systems composed of interconnected machines with varied computational capabilities often operate in environments where there may be sudden machine failures...
Prasanna Sugavanam, Howard Jay Siegel, Anthony A. ...
MIDDLEWARE
2010
Springer
13 years 8 months ago
Adapting Distributed Real-Time and Embedded Pub/Sub Middleware for Cloud Computing Environments
Enterprise distributed real-time and embedded (DRE) publish/subscribe (pub/sub) systems manage resources and data that are vital to users. Cloud computing—where computing resourc...
Joe Hoffert, Douglas C. Schmidt, Aniruddha S. Gokh...
CISS
2008
IEEE
14 years 4 months ago
Improved bounds for a deterministic sublinear-time Sparse Fourier Algorithm
—This paper improves on the best-known runtime and measurement bounds for a recently proposed Deterministic sublinear-time Sparse Fourier Transform algorithm (hereafter called DS...
Mark A. Iwen, Craig V. Spencer
DAGSTUHL
2007
13 years 11 months ago
Diagonal Circuit Identity Testing and Lower Bounds
In this paper we give the first deterministic polynomial time algorithm for testing whether a diagonal depth-3 circuit C(x1, . . . , xn) (i.e. C is a sum of powers of linear funct...
Nitin Saxena
COCOA
2010
Springer
13 years 8 months ago
Feasibility-Based Bounds Tightening via Fixed Points
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...
Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Libert...