Sciweavers

1451 search results - page 28 / 291
» Order independence and rationalizability
Sort
View
CHARME
2005
Springer
133views Hardware» more  CHARME 2005»
14 years 2 months ago
Symbolic Partial Order Reduction for Rule Based Transition Systems
Partial order (PO) reduction methods are widely employed to combat state explosion during model-checking. In this paper, we develop a partial order reduction algorithm for rule-bas...
Ritwik Bhattacharya, Steven M. German, Ganesh Gopa...
JMLR
2006
87views more  JMLR 2006»
13 years 8 months ago
Second Order Cone Programming Approaches for Handling Missing and Uncertain Data
We propose a novel second order cone programming formulation for designing robust classifiers which can handle uncertainty in observations. Similar formulations are also derived f...
Pannagadatta K. Shivaswamy, Chiranjib Bhattacharyy...
TPHOL
1997
IEEE
14 years 21 days ago
Type Classes and Overloading in Higher-Order Logic
Type classes and overloading are shown to be independent concepts that can both be added to simple higher-order logics in the tradition of Church and Gordon, without demanding more...
Markus Wenzel
CONCUR
1997
Springer
14 years 20 days ago
First-Order Axioms for Asynchrony
We study properties of asynchronous communication independently of any concrete concurrent process paradigm. We give a general-purpose, mathematically rigorous definition of sever...
Peter Selinger
JGS
2010
105views more  JGS 2010»
13 years 7 months ago
Testing for spatial association of qualitative data using symbolic dynamics
Qualitative spatial variables are important in many fields of research. However, unlike the decades-worth of research devoted to the spatial association of quantitative variables, ...
Manuel Ruiz, Fernando López, Antonio P&aacu...