Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

69

Voted

LICS
2002
IEEE

favoriteEmaildiscussreport

128views Automated Reasoning» more LICS 2002»

Calibrating Computational Feasibility by Abstraction Rank

15 years 2 months ago

Calibrating Computational Feasibility by Abstraction Rank

Download www.cs.indiana.edu

Daniel Leivant

Real-time Traffic

Automated Reasoning | LICS 2002 |

claim paper

Related Content

» Grid Resource Ranking Using LowLevel Performance Measurements

» Optimal Multiframe Correspondence with Assignment Tensors

» Recursive Affine Structure and Motion from Image Sequences

» An Architecture for Finding Entities on the Web

» Exploiting Concavity in Bimatrix Games New Polynomially Tractable Subclasses

» Improvements to Gamut Mapping Colour Constancy Algorithms

» A multiranker model for adaptive XML searching

» A Convex Programming Approach to the Trace Quotient Problem

» HypE An Algorithm for Fast HypervolumeBased ManyObjective Optimization

Post Info
More Details (n/a)

Added	15 Jul 2010
Updated	15 Jul 2010
Type	Conference
Year	2002
Where	LICS
Authors	Daniel Leivant

Comments (0)