Sciweavers

3018 search results - page 106 / 604
» Replicating for Performance: Case Studies
Sort
View
WSC
2007
15 years 8 months ago
Finite-sample performance guarantees for one-dimensional stochastic root finding
We study the one-dimensional root finding problem for increasing convex functions. We give gradient-free algorithms for both exact and inexact (stochastic) function evaluations. ...
Samuel Ehrlichman, Shane G. Henderson
JETAI
2002
71views more  JETAI 2002»
15 years 5 months ago
Comparing performance of algorithms for generating concept lattices
Several algorithms that generate the set of all formal concepts and diagram graphs of concept lattices are considered. Some modifications of wellknown algorithms are proposed. Algo...
Sergei O. Kuznetsov, Sergei A. Obiedkov
WAE
2001
222views Algorithms» more  WAE 2001»
15 years 7 months ago
An Experimental Study of Data Migration Algorithms
The data migration problem is the problem of computing a plan for moving data objects stored on devices in a network from one configuration to another. Load balancing or changing u...
Eric J. Anderson, Joseph Hall, Jason D. Hartline, ...
ICCSA
2005
Springer
15 years 11 months ago
High-Level Quantum Chemical Methods for the Study of Photochemical Processes
Multireference configuration interaction calculations have been performed on the excited state energy surfaces of the methyleneimmonium cation using recently developed methods for ...
Hans Lischka, Adélia J. A. Aquino, Mario Ba...
DAGSTUHL
2007
15 years 7 months ago
Empirical Studies in End-User Software Engineering and Viewing Scientific Programmers as End-Users - Position Statement -
My work has two relationships with End User Software Engineering. First, as an Empirical Software Engineer, I am interested in meeting with people who do research into techniques ...
Jeffrey Carver