Sciweavers

971 search results - page 105 / 195
» Approximate Satisfiability and Equivalence
Sort
View
VISUALIZATION
2003
IEEE
15 years 11 months ago
Accelerating Large Data Analysis by Exploiting Regularities
We present techniques for discovering and exploiting regularity in large curvilinear data sets. The data can be based on a single mesh or a mesh composed of multiple submeshes (al...
David Ellsworth, Patrick J. Moran
ICLP
2003
Springer
15 years 11 months ago
Timed Concurrent Constraint Programming: Decidability Results and Their Application to LTL
Abstract The ntcc process calculus is a timed concurrent constraint programming (ccp) model equipped with a first-order linear-temporal logic (LTL) for expressing process specifi...
Frank D. Valencia
SIGECOM
2010
ACM
152views ECommerce» more  SIGECOM 2010»
15 years 11 months ago
Information aggregation in smooth markets
Recent years have seen extensive investigation of the information aggregation properties of prediction markets. However, relatively little is known about conditions under which a ...
Krishnamurthy Iyer, Ramesh Johari, Ciamac Cyrus Mo...
CDC
2009
IEEE
133views Control Systems» more  CDC 2009»
15 years 11 months ago
New insights on generalized Nash games with shared constraints: Constrained and variational equilibria
— We consider generalized noncooperative Nash games with “shared constraints” in which there is a common constraint that players’ strategies are required to satisfy. We add...
Ankur A. Kulkarni, Uday V. Shanbhag
FOSSACS
1999
Springer
15 years 10 months ago
Probabilistic Temporal Logics via the Modal Mu-Calculus
This paper presents a mu-calculus-based modal logic for describing properties of reactive probabilistic labeled transition systems (RPLTSs) and develops a modelchecking algorithm ...
Murali Narasimha, Rance Cleaveland, S. Purushotham...