Sciweavers

1208 search results - page 25 / 242
» Uniform eventown problems
Sort
View
COLT
2001
Springer
15 years 4 months ago
On the Synthesis of Strategies Identifying Recursive Functions
A classical learning problem in Inductive Inference consists of identifying each function of a given class of recursive functions from a finite number of its output values. Unifor...
Sandra Zilles
131
Voted
ALT
2011
Springer
13 years 11 months ago
On Noise-Tolerant Learning of Sparse Parities and Related Problems
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...
Elena Grigorescu, Lev Reyzin, Santosh Vempala
DLOG
2008
15 years 2 months ago
Locality and Subsumption Testing in EL and Some of its Extensions
Abstract. We show that subsumption problems in EL and related description logics can be expressed as uniform word problems in classes of semilattices with monotone operators. We us...
Viorica Sofronie-Stokkermans
RTA
2005
Springer
15 years 5 months ago
Termination of Single-Threaded One-Rule Semi-Thue Systems
Abstract. This paper is a contribution to the long standing open problem of uniform termination of Semi-Thue Systems that consist of one rule s → t. McNaughton previously showed ...
Wojciech Moczydlowski, Alfons Geser
94
Voted
AUTOMATICA
2008
90views more  AUTOMATICA 2008»
14 years 11 months ago
Average consensus problems in networks of agents with delayed communications
The present paper is devoted to the study of average consensus problems for undirected networks of dynamic agents having communication delays. By focusing on agents with integrato...
Pierre-Alexandre Bliman, Giancarlo Ferrari-Trecate