Sciweavers

952 search results - page 47 / 191
» Computational complexity of stochastic programming problems
Sort
View
ICALP
1992
Springer
14 years 3 months ago
Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine
Abstract Bernard Chazelle Department of Computer Science Princeton University Burton Rosenberg Department of Mathematics and Computer Science Dartmouth College We give a lower bou...
Bernard Chazelle, Burton Rosenberg
ANOR
2010
119views more  ANOR 2010»
13 years 11 months ago
Optimisation of maintenance scheduling strategies on the grid
Abstract-- The emerging paradigm of Grid Computing provides a powerful platform for the optimisation of complex computer models, such as those used to simulate real-world logistics...
Alex Shenfield, Peter J. Fleming, Visakan Kadirkam...
ICALP
2005
Springer
14 years 4 months ago
Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity
We develop a new method for estimating the discrepancy of tensors associated with multiparty communication problems in the “Number on the Forehead” model of Chandra, Furst and...
Jeff Ford, Anna Gál
ICALP
2005
Springer
14 years 4 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
VMCAI
2005
Springer
14 years 4 months ago
On the Complexity of Error Explanation
When a system fails to satisfy its specification, the model checker produces an error trace (or counter-example) that demonstrates an undesirable behavior, which is then used in d...
Nirman Kumar, Viraj Kumar, Mahesh Viswanathan