Amanote Research

Amanote Research

    RegisterSign In

Slow Abstraction via Priority

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-39698-4_20
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2013

Authors
A. W. RoscoePhilippa J. Hopcroft
Publisher

Springer Berlin Heidelberg


Related search

Solving Games via Three-Valued Abstraction Refinement

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
2010English

Reachability Analysis of Hybrid Systems via Predicate Abstraction

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

Mind the Shapes: Abstraction Refinement via Topology Invariants

English

Numeric Planning via Abstraction and Policy Guided Search

2017English

Efficient Weighted Model Integration via SMT-Based Predicate Abstraction

2017English

Backward Analysis via Over-Approximate Abstraction and Under-Approximate Subtraction

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Comments On: Dynamic Priority Allocation via Restless Bandit Marginal Productivity Indices

TOP
Information SystemsProbabilityCombinatoricsSimulationManagement ScienceManagementStatisticsDiscrete MathematicsModelingOperations Research
2007English

When Abstraction Fails

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

How Abstraction Works

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy