Result 1 to 20 of 71 total
Topic 10: parallel numerical algorithms. (English)
Kaklamanis, Christos (ed.) et al., Euro-Par 2012 parallel processing. 18th international conference, Euro-Par 2012, Rhodes Island, Greece, August 27‒31, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32819-0/pbk). Lecture Notes in Computer Science 7484, 550 (2012).
1
Efficient preconditioner updates for shifted linear systems. (English)
SIAM J. Sci. Comput. 33, No. 4, 1785-1809 (2011).
2
Introduction. (English)
Jeannot, Emmanuel (ed.) et al., Euro-Par 2011 parallel processing. 17th international conference, Euro-Par 2011, Bordeaux, France, August 29‒September 2, 2011. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-23396-8/pbk). Lecture Notes in Computer Science 6853, 65 (2011).
3
A modified dividing rectangles algorithm for a problem in astrophysics (English)
J. Optimization Theory and Applications 151, No. 1, 175-190 (2011).
4
Parallel numerical algorithms. (English)
D’Ambra, Pasqua (ed.) et al., Euro-Par 2010 ‒ parallel processing. 16th international Euro-Par conference, Ischia, Italy, August 31 ‒ September 3, 2010. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-15290-0/pbk). Lecture Notes in Computer Science 6272, 63-64 (2010).
6
A genetic algorithm for a global optimization problem arising in the detection of gravitational waves. (English)
J. Glob. Optim. 48, No. 1, 41-55 (2010).
7
A new fully dynamic algorithm for distributed shortest paths and its experimental evaluation. (English)
Festa, Paola (ed.), Experimental algorithms. 9th international symposium, SEA 2010, Ischia Island, Naples, Italy, May 20‒22, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13192-9/pbk). Lecture Notes in Computer Science 6049, 59-70 (2010).
8
Partially dynamic efficient algorithms for distributed shortest paths. (English)
Theor. Comput. Sci. 411, No. 7-9, 1013-1037 (2010).
9
Starting-point strategies for an infeasible potential reduction method (English)
Optimization Letters 4, No. 1, 131-146 (2010).
10
MLD2P4: A package of parallel algebraic multilevel domain decomposition preconditioners in Fortran 95 (English)
ACM Trans. Math. Softw. 37, No. 3 (2010).
11
Parallel numerical algorithms (English)
Euro-Par (2), 63-64 (2010).
12
A new fully dynamic algorithm for distributed shortest paths and its experimental evaluation (English)
SEA, 59-70 (2010).
13
On the application of multiple-deme parallel genetic algorithms in astrophysics (English)
PDP, 231-237 (2010).
14
Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases. (English)
J. Comb. Optim. 18, No. 3, 229-257 (2009).
15
Recoverable robustness in shunting and timetabling (English)
Robust and Online Large-Scale Optimization, 28-60 (2009).
16
On the use of aggregation-based parallel multilevel preconditioners in the LES of wall-bounded turbulent flows (English)
LSSC, 67-75 (2009).
17
Dynamic algorithms for recoverable robustness problems. (English)
Fiscetti, Matteo (ed.) et al., 8th workshop on algorithmic approaches for transportation modeling, optimization, and systems (ATMOS’08). Papers based on the presentations at the workshop, September 18, 2008, Karlsruhe, Germany. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-07-1). OASIcs ‒ OpenAccess Series in Informatics 9, 20 p., electronic only (2008).
18
Delay management problem: Complexity results and robust algorithms. (English)
Yang, Boting (ed.) et al., Combinatorial optimization and applications. Second international conference, COCOA 2008, St. John’s, NL, Canada, August 21‒24, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85096-0/pbk). Lecture Notes in Computer Science 5165, 458-468 (2008).
19
Dynamic multi-level overlay graphs for shortest paths. (English)
Math. Comput. Sci. 1, No. 4, 709-736 (2008).
20
Result 1 to 20 of 71 total
Start
Contact
Print
General Help
