Sciweavers

1477 search results - page 151 / 296
» Random Convex Programs
Sort
View
ICALP
2005
Springer
14 years 2 months ago
Quantum Complexity of Testing Group Commutativity
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...
Frédéric Magniez, Ashwin Nayak
ASYNC
1997
IEEE
66views Hardware» more  ASYNC 1997»
14 years 1 months ago
Speculative Completion for the Design of High-Performance Asynchronous Dynamic Adders
This paper presents an in-depth case study in highperformance asynchronous adder design. A recent method, called “speculative completion”, is used. This method uses single-rai...
Steven M. Nowick, Kenneth Y. Yun, Ayoob E. Dooply,...
HOTOS
1997
IEEE
14 years 1 months ago
Building Diverse Computer Systems
Diversity is an important source of robustness in biological systems. Computers, by contrast, are notable for their lack of diversity. Although homogeneous systems have many advan...
Stephanie Forrest, Anil Somayaji, David H. Ackley
SIAMJO
2008
97views more  SIAMJO 2008»
13 years 9 months ago
New Formulations for Optimization under Stochastic Dominance Constraints
Stochastic dominance constraints allow a decision-maker to manage risk in an optimization setting by requiring their decision to yield a random outcome which stochastically domina...
James Luedtke
PTS
2010
134views Hardware» more  PTS 2010»
13 years 7 months ago
A Learning-Based Approach to Unit Testing of Numerical Software
We present an application of learning-based testing to the problem of automated test case generation (ATCG) for numerical software. Our approach uses n-dimensional polynomial model...
Karl Meinke, Fei Niu