150 search results - page 13 / 30 » Counting Results in Weak Formalisms |
IPL
2008
13 years 8 months ago
2008
Undefined terms involving the application of partial functions and operators are common in program specifications and in discharging proof obligations that arise in design. One wa...
ACTA
2011
13 years 3 months ago
2011
A simple mutual exclusion algorithm is presented that only uses nonatomic shared variables of bounded size, and that satisfies bounded overtaking. When the shared variables behave...
SLOGICA
2010
13 years 7 months ago
2010
Abstract. The naive set theory problem is to begin with a full comprehension axiom, and to find a logic strong enough to prove theorems, but weak enough not to prove everything. T...
IJVR
2007
13 years 8 months ago
2007
—We present an empirical usability experiment studying the relative strengths and weaknesses of three different occlusion management techniques for discovering and accessing obje...
COLING
2010
13 years 3 months ago
2010
We conduct a series of Part-of-Speech (POS) Tagging experiments using Expectation Maximization (EM), Variational Bayes (VB) and Gibbs Sampling (GS) against the Chinese Penn Treeba...