1941 search results - page 260 / 389 » On the Hardness of Approximate Reasoning |
214
click to vote
COMGEO
2012
ACM
14 years 2 months ago
2012
ACM
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...
260
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
184
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
We present a parametric Hoare-like logic for computer-aided reasoning about typeable properties of functional programs. The logic is based on the concept of a specialised assertio...
179
click to vote
ICRA
2008
IEEE
16 years 24 days ago
2008
IEEE
— Local linearizations are ubiquitous in the control of robotic systems. Analytical methods, if available, can be used to obtain the linearization, but in complex robotics system...
196
click to vote
ICLP
2010
Springer
2010
Springer
A Framework for Verification and Debugging of Resource Usage Properties: Resource Usage Verification
15 years 4 months ago
We present a framework for (static) verification of general resource usage program properties. The framework extends the criteria of correctness as the conformance of a program to ...