Sciweavers

8025 search results - page 130 / 1605
» Combinators Introduction: An Algorithm
Sort
View
EC
2007
167views ECommerce» more  EC 2007»
15 years 1 months ago
Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...
Sylvain Gelly, Sylvie Ruette, Olivier Teytaud
VL
2002
IEEE
110views Visual Languages» more  VL 2002»
15 years 6 months ago
Empirical Evidence that Algorithm Animation Promotes Understanding of Distributed Algorithms
Previous studies of program visualization have generally failed to provide convincing support for the benefits of algorithm animation in promoting the understanding of computatio...
Mihail Eduard Tudoreanu, Rong Wu, Ashley Hamilton-...
IMECS
2007
15 years 3 months ago
A Genetic Algorithm for Optimizing Facility Layout in a Wafer Fab
—In this research, the Genetic Algorithm (GA) and Space-Filling Curve (SFC) are combined along with the use of Taguchi method for finding the optimal combination of parameters. T...
Michael H. Hu, Meei-Yuh Ku, Chao-Chi Chen
CSCLP
2005
Springer
15 years 7 months ago
Complexity Analysis of Heuristic CSP Search Algorithms
CSP search algorithms are exponential in the worst-case. A trivial upper bound on the time complexity of CSP search algorithms is O∗ (dn ), where n and d are the number of variab...
Igor Razgon
ICALP
2007
Springer
15 years 8 months ago
Modular Algorithms for Heterogeneous Modal Logics
Abstract. State-based systems and modal logics for reasoning about them often heterogeneously combine a number of features such as non-determinism and probabilities. Here, we show ...
Lutz Schröder, Dirk Pattinson