1943 search results - page 242 / 389 » Ordering Default Theories |
192
Voted
POPL
2010
ACM
16 years 4 months ago
2010
ACM
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...
212
click to vote
CCA
2009
Springer
16 years 1 months ago
2009
Springer
In the theory of algorithmic randomness, several notions of random sequence are defined via a game-theoretic approach, and the notions that received most attention are perhaps Mar...
217
Voted
PKDD
1999
Springer
15 years 11 months ago
1999
Springer
When mining a large database, the number of patterns discovered can easily exceed the capabilities of a human user to identify interesting results. To address this problem, variou...
183
Voted
CAGD
2006
15 years 7 months ago
2006
We introduce a new family of subdivision schemes called jet subdivision schemes. Jet subdivision schemes are a natural generalization of the commonly used subdivision schemes for ...
203
Voted
JSYML
2007
15 years 7 months ago
2007
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...