Sciweavers

2981 search results - page 445 / 597
» Answer Set Planning
Sort
View
KR
2010
Springer
15 years 11 months ago
Walking the Decidability Line for Rules with Existential Variables
We consider positive rules in which the conclusion may contain existentially quantified variables, which makes reasoning tasks (such as Deduction) undecidable. These rules have t...
Jean-François Baget, Michel LeClere, Marie-...
CSE
2009
IEEE
15 years 11 months ago
Processing Approximate Moving Range Queries in Mobile Sensor Environments
— The ubiquity of mobile devices has led to a rising demand for location-based services and applications. A major part of these services is based on the location-detection capabi...
Antoniya Petkova, Kien A. Hua, Alexander J. Aved
ACML
2009
Springer
15 years 11 months ago
Learning Algorithms for Domain Adaptation
A fundamental assumption for any machine learning task is to have training and test data instances drawn from the same distribution while having a sufficiently large number of tra...
Manas A. Pathak, Eric Nyberg
CONCUR
2001
Springer
15 years 11 months ago
Symbolic Computation of Maximal Probabilistic Reachability
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...
ESA
2001
Springer
110views Algorithms» more  ESA 2001»
15 years 11 months ago
Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks
We study the completion time of broadcast operations on static ad hoc wireless networks in presence of unpredictable and dynamical faults. Concerning oblivious fault-tolerant dist...
Andrea E. F. Clementi, Angelo Monti, Riccardo Silv...