Sciweavers

1302 search results - page 197 / 261
» Free-Style Theorem Proving
Sort
View
CORR
2007
Springer
217views Education» more  CORR 2007»
13 years 8 months ago
Hard constraint satisfaction problems have hard gaps at location 1
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
JACM
2000
77views more  JACM 2000»
13 years 8 months ago
The fault span of crash failures
A crashing network protocol is an asynchronous protocol whose memory does not survive crashes. We show that a crashing network protocol that works over unreliable links can be driv...
George Varghese, Mahesh Jayaram
JFP
2000
91views more  JFP 2000»
13 years 8 months ago
Uniform confluence in concurrent computation
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
Joachim Niehren
ANSOFT
1998
157views more  ANSOFT 1998»
13 years 8 months ago
Software Engineering Programmes are not Computer Science Programmes
Programmes in “Software Engineering” have become a source of contention in many universities. Computer Science departments, many of which have used that phrase to describe ind...
David Lorge Parnas
TSMC
2002
112views more  TSMC 2002»
13 years 8 months ago
An efficient algorithm for automatically generating multivariable fuzzy systems by Fourier series method
By exploiting the Fourier series expansion, we have developed a new constructive method of automatically generating a multivariable fuzzy inference system from any given sample set...
Liang Chen, Naoyuki Tokuda