Sciweavers

3047 search results - page 500 / 610
» On the Meaning of Logical Completeness
Sort
View
COLING
2010
14 years 4 months ago
Knowing What to Believe (when you already know something)
Although much work in NLP has focused on simply determining what a document means, we also must know whether or not to believe it. Fact-finding algorithms attempt to identify the ...
Jeff Pasternack, Dan Roth
ACTA
2011
14 years 4 months ago
Nonatomic dual bakery algorithm with bounded tokens
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...
Alex A. Aravind, Wim H. Hesselink
JSC
2010
100views more  JSC 2010»
14 years 4 months ago
An invariant-based approach to the verification of asynchronous parameterized networks
A uniform verification problem for parameterized systems is to determine whether a temporal property is satisfied for every instance of the system which is composed of an arbitrar...
Igor V. Konnov, Vladimir A. Zakharov
MANSCI
2010
108views more  MANSCI 2010»
14 years 4 months ago
Capacity Sizing Under Parameter Uncertainty: Safety Staffing Principles Revisited
We study a capacity sizing problem in a service system that is modeled as a single-class queue with multiple servers and where customers may renege while waiting for service. A sa...
Achal Bassamboo, Ramandeep S. Randhawa, Assaf J. Z...
CORR
2011
Springer
140views Education» more  CORR 2011»
14 years 1 months ago
A Wiki for Business Rules in Open Vocabulary, Executable English
The problem of business-IT alignment is of widespread economic concern. As one way of addressing the problem, this paper describes an online system that functions as a kind of Wik...
Adrian Walker