Sciweavers

787 search results - page 81 / 158
» Polynomial Constants are Decidable
Sort
View
GECCO
2004
Springer
118views Optimization» more  GECCO 2004»
14 years 2 months ago
Adaptive Sampling for Noisy Problems
Abstract. The usual approach to deal with noise present in many realworld optimization problems is to take an arbitrary number of samples of the objective function and use the samp...
Erick Cantú-Paz
ICRA
1999
IEEE
114views Robotics» more  ICRA 1999»
14 years 1 months ago
An Effective Method to Reduce Inventory in Job Shops
Inventory plays a major role in deciding the overall manufacturing costs, and a good scheduling system should balance the on-time delivery of products versus low work-in-process (W...
Peter B. Luh, Xiaohui Zhou, Robert N. Tomastik
COCO
2006
Springer
113views Algorithms» more  COCO 2006»
14 years 1 months ago
On the Complexity of Numerical Analysis
We study two quite different approaches to understanding the complexity of fundamental problems in numerical analysis. We show that both hinge on the question of understanding the...
Eric Allender, Peter Bürgisser, Johan Kjeldga...
ICALP
1995
Springer
14 years 26 days ago
Parallel Algorithms with Optimal Speedup for Bounded Treewidth
We describe the rst parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algori...
Hans L. Bodlaender, Torben Hagerup
CSL
2008
Springer
13 years 11 months ago
Quantified Positive Temporal Constraints
Abstract. A positive temporal template (or a positive temporal constraint language) is a relational structure whose relations can be defined over countable dense linear order witho...
Witold Charatonik, Michal Wrona