Sciweavers

1894 search results - page 212 / 379
» A TLA Proof System
Sort
View
JSAT
2008
79views more  JSAT 2008»
15 years 4 months ago
An Extended Semidefinite Relaxation for Satisfiability
This paper proposes a new semidefinite programming relaxation for the satisfiability problem. This relaxation is an extension of previous relaxations arising from the paradigm of ...
Miguel F. Anjos
JCSS
2006
89views more  JCSS 2006»
15 years 4 months ago
Ramsey-type theorems for metric spaces with applications to online problems
A nearly logarithmic lower bound on the randomized competitive ratio for the metrical task systems problem is presented. This implies a similar lower bound for the extensively stu...
Yair Bartal, Béla Bollobás, Manor Me...
ORL
2008
71views more  ORL 2008»
15 years 4 months ago
A note on polling models with renewal arrivals and nonzero switch-over times
We consider polling systems with general service times and switch-over times, gated service at all queues and with general renewal arrival processes. We derive closed-form express...
Robert D. van der Mei, Erik M. M. Winands
AML
2004
96views more  AML 2004»
15 years 4 months ago
Analytic Calculi for Product Logics
Abstract. Product logic is an important t-norm based fuzzy logic with conjunction interpreted as multiplication on the real unit interval [0, 1], while Cancellative hoop logic CHL ...
George Metcalfe, Nicola Olivetti, Dov M. Gabbay
CSL
2002
Springer
15 years 4 months ago
Hoare Logics for Recursive Procedures and Unbounded Nondeterminism
This paper presents sound and complete Hoare logics for partial and total correctness of recursive parameterless procedures in the context of unbounded nondeterminism. For total co...
Tobias Nipkow