Sciweavers

5263 search results - page 519 / 1053
» Open Constraint Optimization
Sort
View
ICSM
2005
IEEE
16 years 18 days ago
The Top Ten List: Dynamic Fault Prediction
To remain competitive in the fast paced world of software development, managers must optimize the usage of their limited resources to deliver quality products on time and within b...
Ahmed E. Hassan, Richard C. Holt
ICCS
2005
Springer
16 years 16 days ago
Computational Complexity and Distributed Execution in Water Quality Management
Abstract. Modeling is considered an inherent part of design, operation and optimization of Water Quality Systems. Models are used for running so-called Virtual Experiments, such as...
Maria Chtepen, Filip H. A. Claeys, Bart Dhoedt, Pe...
IPPS
1998
IEEE
15 years 11 months ago
An O((log log n)2) Time Convex Hull Algorithm on Reconfigurable Meshes
It was open for more than eight years to obtain an algorithm for computing the convex hull of a set of n sorted points in sub-logarithmic time on a reconfigurable mesh of size pn ...
Tatsuya Hayashi, Koji Nakano, Stephan Olariu
FOCS
1993
IEEE
15 years 11 months ago
Simulated Annealing for Graph Bisection
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...
Mark Jerrum, Gregory B. Sorkin
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
15 years 8 months ago
Deterministic Sampling Algorithms for Network Design
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
Anke van Zuylen