Sciweavers

773 search results - page 137 / 155
» Program Slicing by Calculation
Sort
View
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 9 months ago
Decentralized Search with Random Costs
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Oskar Sandberg
SIAMSC
2010
132views more  SIAMSC 2010»
13 years 8 months ago
New Algorithms for Optimal Online Checkpointing
Frequently, the computation of derivatives for optimizing time-dependent problems is based on the integration of the adjoint differential equation. For this purpose, the knowledge...
Philipp Stumm, Andrea Walther
VL
2010
IEEE
218views Visual Languages» more  VL 2010»
13 years 8 months ago
Using Association Metrics to Help Users Navigate API Documentation
-- In the past decade there has been spectacular growth in the number and size of third-party libraries, frameworks, toolkits and other Application Programming Interfaces (APIs) av...
Daniel S. Eisenberg, Jeffrey Stylos, Andrew Faulri...
ICST
2009
IEEE
13 years 7 months ago
A Flexible Framework for Quality Assurance of Software Artefacts with Applications to Java, UML, and TTCN-3 Test Specifications
Manual reviews and inspections of software artefacts are time consuming and thus, automated analysis tools have been developed to support the quality assurance of software artefac...
Jens Nodler, Helmut Neukirchen, Jens Grabowski
CDC
2010
IEEE
210views Control Systems» more  CDC 2010»
13 years 4 months ago
Advances in moving horizon estimation for nonlinear systems
In the past decade, moving horizon estimation (MHE) has emerged as a powerful technique for estimating the state of a dynamical system in the presence of nonlinearities and disturb...
Angelo Alessandri, Marco Baglietto, Giorgio Battis...