Sciweavers

8094 search results - page 350 / 1619
» Improvements in Formula Generalization
Sort
View
COLT
2007
Springer
16 years 13 days ago
A Lower Bound for Agnostically Learning Disjunctions
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
Adam R. Klivans, Alexander A. Sherstov
CSL
2007
Springer
16 years 13 days ago
On the Complexity of Reasoning About Dynamic Policies
We study the complexity of satisfiability for DLP+ dyn , an expressive logic introduced by Demri that allows to reason about dynamic policies. DLP+ dyn extends the logic DLPdyn of...
Stefan Göller
IPSN
2007
Springer
16 years 12 days ago
Probabilistic detection of mobile targets in heterogeneous sensor networks
Target detection and field surveillance are among the most prominent applications of Sensor Networks (SN). The quality of detection achieved by a SN can be quantified by evaluat...
Loukas Lazos, Radha Poovendran, James A. Ritcey
TABLEAUX
2007
Springer
16 years 11 days ago
Tableau Systems for Logics of Subinterval Structures over Dense Orderings
We construct a sound, complete, and terminating tableau system for the interval temporal logic D · interpreted in interval structures over dense linear orderings endowed with stri...
Davide Bresolin, Valentin Goranko, Angelo Montanar...
AICT
2006
IEEE
16 years 9 days ago
Optimal Solution of the Maximum All Request Path Grooming Problem
— We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the ma...
Jean-Claude Bermond, Michel Cosnard, David Coudert...