In the early 1920s, Pavel Urysohn proved his famous lemma (sometimes referred to as "first non-trivial result of point set topology"). Among other applications, this lemm...
Within a lattice approach, the purpose of this paper is to give general necessary and sufficient conditions for internal stabilizability and for the existence of (weakly) left-/rig...
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
This paper proposes two new methods for optimizing objectives and constraints. The GP approach is very general and hardware resources in finite wordlength implementation of it allo...