952 search results - page 42 / 191 » Computational complexity of stochastic programming problems |
139
Voted
AUTOMATICA
2011
14 years 7 months ago
2011
An asynchronous stochastic approximation based (Frequentist) approach is proposed for mapping using noisy mobile sensors under two different scenarios: 1) perfectly known sensor ...
112
Voted
ERSHOV
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We consider the problem of query containment for conjunctive queries with safe negation property. A necessary and sufficient condition for two queries to be in containmen...
105
click to vote
STACS
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
105
Voted
ISSTA
2010
ACM
15 years 4 months ago
2010
ACM
Whitebox fuzzing is a novel form of security testing based on dynamic symbolic execution and constraint solving. Over the last couple of years, whitebox fuzzers have found many ne...
100
Voted
ECAL
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Inspired by the recent advances in evolutionary biology, we have developed a self-organising, self-adaptable cellular system for multitask learning. The main aim of our p...