Reliable Computing (2005) 11: 499–503 DOI: 10.1007/s11155-005-0408-6 Reliable Computations and Their Applications (RCA) Track ATechnical Track at the 20th ACM Symposium on Applied Computing SAC’2005 Santa Fe, New Mexico, USA, March 13–17, 2005 1. SAC’05 For the past twenty years, the ACM Symposium on Applied Computing has been a primary gathering forum for applied computer scientists, computer engineers, software engineers, and application developers from around the world. 2. RCA Track: Motivations Many numerical computations, be they solutions to systems of differential equa- tions or optimization problems coming from applied areas like protein folding, do not provide us with guaranteed computation results. In many situations, we have numerical solutions, we may even have a theorem guaranteeing that eventually, this numerical solution tends to the actual precise one, but the algorithm itself does not provide us with guaranteed bounds on the difference between the numerical approximate solution and the desired actual one. Therefore, in some practical situations, numerical solutions are much farther from the actual (unknown) precise solutions than the users assume. As a result, we often end up with inefﬁcient local maxima for practical optimization problems like chemical engineering—or even with a mission failure if we are planning, e.g., a
Reliable Computing – Springer Journals
Published: Jan 1, 2005
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud