Sciweavers

26 search results - page 4 / 6
» Nearly Tight Bounds for Testing Function Isomorphism
Sort
View
MOBIHOC
2007
ACM
14 years 7 months ago
Bounds for the capacity of wireless multihop networks imposed by topology and demand
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
Alireza Keshavarz-Haddad, Rudolf H. Riedi
EMO
2005
Springer
120views Optimization» more  EMO 2005»
14 years 1 months ago
Multiobjective Optimization on a Budget of 250 Evaluations
Abstract. In engineering and other ‘real-world’ applications, multiobjective optimization problems must frequently be tackled on a tight evaluation budget — tens or hundreds ...
Joshua D. Knowles, Evan J. Hughes
MICRO
2003
IEEE
106views Hardware» more  MICRO 2003»
14 years 27 days ago
Single-ISA Heterogeneous Multi-Core Architectures: The Potential for Processor Power Reduction
This paper proposes and evaluates single-ISA heterogeneous multi-core architectures as a mechanism to reduce processor power dissipation. Our design incorporates heterogeneous cor...
Rakesh Kumar, Keith I. Farkas, Norman P. Jouppi, P...
CORR
2010
Springer
160views Education» more  CORR 2010»
13 years 7 months ago
New Results on Quantum Property Testing
We present several new examples of speed-ups obtainable by quantum algorithms in the context of property testing. First, motivated by sampling algorithms, we consider probability d...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, ...
ECCC
2008
93views more  ECCC 2008»
13 years 7 months ago
A Note on the Distance to Monotonicity of Boolean Functions
Given a function f : {0, 1}n {0, 1}, let M (f) denote the smallest distance between f and a monotone function on {0, 1}n . Let M (f) denote the fraction of hypercube edges where f...
Arnab Bhattacharyya