Sökning: "Incremental Algorithms"
Visar resultat 1 - 5 av 42 avhandlingar innehållade orden Incremental Algorithms.
1. Asynchronous Algorithms for Large-Scale Optimization : Analysis and Implementation
Sammanfattning : This thesis proposes and analyzes several first-order methods for convex optimization, designed for parallel implementation in shared and distributed memory architectures. The theoretical focus is on designing algorithms that can run asynchronously, allowing computing nodes to execute their tasks with stale information without jeopardizing convergence to the optimal solution. LÄS MER
2. Asynchronous First-Order Algorithms for Large-Scale Optimization : Analysis and Implementation
Sammanfattning : Developments in communication and data storage technologies have made large-scale data collection more accessible than ever. The transformation of this data into insight or decisions typically involves solving numerical optimization problems. LÄS MER
3. Incremental Learning and Testing of Reactive Systems
Sammanfattning : This thesis concerns the design, implementation and evaluation of a specification based testing architecture for reactive systems using the paradigm of learning-based testing. As part of this work we have designed, verified and implemented new incremental learning algorithms for DFA and Kripke structures. LÄS MER
4. Efficient Temporal Reasoning with Uncertainty
Sammanfattning : Automated Planning is an active area within Artificial Intelligence. With the help of computers we can quickly find good plans in complicated problem domains, such as planning for search and rescue after a natural disaster. When planning in realistic domains the exact duration of an action generally cannot be predicted in advance. LÄS MER
5. Set Constraints for Local Search
Sammanfattning : Combinatorial problems are ubiquitous in our society and solving such problems efficiently is often crucial. One technique for solving combinatorial problems is constraint-based local search. Its compositional nature together with its efficiency on large problem instances have made this technique particularly attractive. LÄS MER