Sciweavers

314 search results - page 38 / 63
» Complete Problems for Dynamic Complexity Classes
Sort
View
94
Voted
CORR
2008
Springer
141views Education» more  CORR 2008»
14 years 9 months ago
Model checking memoryful linear-time logics over one-counter automata
We study complexity of the model-checking problems for LTL with registers (also known as freeze LTL and written LTL ) and for first-order logic with data equality tests (written F...
Stéphane Demri, Ranko Lazic, Arnaud Sangnie...
108
Voted
UAI
1997
14 years 11 months ago
A Scheme for Approximating Probabilistic Inference
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
Rina Dechter, Irina Rish
69
Voted
IWCLS
2007
Springer
15 years 3 months ago
Revisiting UCS: Description, Fitness Sharing, and Comparison with XCS
Abstract. This paper provides a deep insight into the learning mechanisms of UCS, a learning classifier system (LCS) derived from XCS that works under a supervised learning scheme...
Albert Orriols-Puig, Ester Bernadó-Mansilla
91
Voted
ASP
2003
Springer
15 years 2 months ago
Outlier Detection Using Default Logic
Default logic is used to describe regular behavior and normal properties. We suggest to exploit the framework of default logic for detecting outliers - individuals who behave in a...
Fabrizio Angiulli, Rachel Ben-Eliyahu-Zohary, Luig...
ICNP
2000
IEEE
15 years 2 months ago
Optimal Partitioning of Multicast Receivers
Multicast sessions may have a large number of receivers with heterogeneous reception capacities. To accommodate this heterogeneity, various multi-rate schemes, based upon the use ...
Yang Richard Yang, Min Sik Kim, Simon S. Lam