Sciweavers

7991 search results - page 32 / 1599
» Using More Reasoning to Improve
Sort
View
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
15 years 9 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
CSFW
2003
IEEE
15 years 5 months ago
Using First-Order Logic to Reason about Policies
A policy describes the conditions under which an action is permitted or forbidden. We show that a fragment of (multi-sorted) first-order logic can be used to represent and reason...
Joseph Y. Halpern, Vicky Weissman
SBIA
2004
Springer
15 years 5 months ago
Reasoning About Requirements Evolution Using Clustered Belief Revision
During the development of system requirements, software system specifications are often inconsistent. Inconsistencies may arise for different reasons, for example, when multiple...
Odinaldo Rodrigues, Artur S. d'Avila Garcez, Aless...
KES
2008
Springer
14 years 11 months ago
Reinforcing fuzzy rule-based diagnosis of turbomachines with case-based reasoning
This paper presents an integrated knowledge-based system, which combines fuzzy rule-based reasoning with case-based reasoning, for turbomachinery diagnosis. By incorporating a case...
Meijun Yang, Qiang Shen
HPCA
1999
IEEE
15 years 4 months ago
Using Lamport Clocks to Reason about Relaxed Memory Models
Cache coherence protocols of current shared-memory multiprocessors are difficult to verify. Our previous work proposed an extension of Lamport's logical clocks for showing th...
Anne Condon, Mark D. Hill, Manoj Plakal, Daniel J....