Sciweavers

1772 search results - page 201 / 355
» Classifying Problems into Complexity Classes
Sort
View
LICS
2006
IEEE
16 years 14 days ago
PSPACE Bounds for Rank-1 Modal Logics
aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descri...
Lutz Schröder, Dirk Pattinson
JC
2007
101views more  JC 2007»
15 years 6 months ago
Simple Monte Carlo and the Metropolis algorithm
We study the integration of functions with respect to an unknown density. Information is available as oracle calls to the integrand and to the nonnormalized density function. We ar...
Peter Mathé, Erich Novak
FUIN
2010
116views more  FUIN 2010»
15 years 3 months ago
An Investigation of Multi-Agent Planning in CLP
This paper explores the use of Constraint Logic Programming (CLP) as a platform for experimenting with planning problems in the presence of multiple interacting agents. The paper ...
Agostino Dovier, Andrea Formisano, Enrico Pontelli
PRDC
2007
IEEE
16 years 22 days ago
Failure Detectors and Extended Paxos for k-Set Agreement
Failure detector class Ωk has been defined in [18] as an extension to failure detector Ω, and an algorithm has been given in [16] to solve k-set agreement using Ωk in async...
Wei Chen, Jialin Zhang, Yu Chen, Xuezheng Liu
COLT
1999
Springer
15 years 10 months ago
Uniform-Distribution Attribute Noise Learnability
We study the problem of PAC-learning Boolean functions with random attribute noise under the uniform distribution. We define a noisy distance measure for function classes and sho...
Nader H. Bshouty, Jeffrey C. Jackson, Christino Ta...