Sciweavers

490 search results - page 62 / 98
» Equivalent Keys of HPC
Sort
View
ASP
2005
Springer
14 years 2 months ago
Applications of Preferences using Answer Set Programming
Preferences are useful when the space of feasible solutions of a given problem is dense but not all these solutions are equivalent w.r.t. some additional requirements. In this case...
Claudia Zepeda, Mauricio Osorio, Juan Carlos Nieve...
CALCO
2005
Springer
105views Mathematics» more  CALCO 2005»
14 years 2 months ago
Bisimilarity Is Not Finitely Based over BPA with Interrupt
This paper shows that bisimulation equivalence does not afford a finite equational axiomatization over the language obtained by enriching Bergstra and Klop’s Basic Process Alge...
Luca Aceto, Wan Fokkink, Anna Ingólfsd&oacu...
CSL
2005
Springer
14 years 2 months ago
Feasible Proofs of Matrix Properties with Csanky's Algorithm
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
Michael Soltys
ATAL
2004
Springer
14 years 2 months ago
Towards a Formalization of Teamwork with Resource Constraints
Despite the recent advances in distributed MDP frameworks for reasoning about multiagent teams, these frameworks mostly do not reason about resource constraints, a crucial issue i...
Praveen Paruchuri, Milind Tambe, Fernando Ord&oacu...
ICFEM
2004
Springer
14 years 2 months ago
Memory-Model-Sensitive Data Race Analysis
Abstract. We present a “memory-model-sensitive” approach to validating correctness properties for multithreaded programs. Our key insight is that by specifying both the inter-t...
Yue Yang, Ganesh Gopalakrishnan, Gary Lindstrom