Sciweavers

644 search results - page 2 / 129
» A topological characterization of weakness
Sort
View
IPL
2010
81views more  IPL 2010»
13 years 3 months ago
An alternative characterization of weak order dependence
Control dependence forms the basis for many program analyses, such as program slicing. Recent work on control dependence analysis has led to new definitions of dependence that cat...
Torben Amtoft, Kelly Androutsopoulos, David Clark,...
ATAL
2011
Springer
12 years 5 months ago
Towards a unifying characterization for quantifying weak coupling in dec-POMDPs
Researchers in the field of multiagent sequential decision making have commonly used the terms “weakly-coupled” and “loosely-coupled” to qualitatively classify problems i...
Stefan J. Witwicki, Edmund H. Durfee
STOC
1994
ACM
128views Algorithms» more  STOC 1994»
13 years 9 months ago
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, ...
JSYML
2010
69views more  JSYML 2010»
12 years 12 months ago
Topological properties of sets definable in weakly o-minimal structures
The paper is aimed at studying the topological dimension for sets definable in weakly o-minimal structures in order to prepare background for further investigation of groups, grou...
Roman Wencel
AAAI
2007
13 years 7 months ago
Topological Mapping with Weak Sensory Data
In this paper, we consider the exploration of topological environments by a robot with weak sensory capabilities. We assume only that the robot can recognize when it has reached a...
Gregory Dudek, Dimitri Marinakis