Sciweavers

851 search results - page 85 / 171
» Inaccessibility in Decision Procedures
Sort
View
TIME
2009
IEEE
14 years 3 months ago
Fixing the Semantics for Dynamic Controllability and Providing a More Practical Characterization of Dynamic Execution Strategies
Morris, Muscettola and Vidal (MMV) presented an algorithm for checking the dynamic controllability (DC) of temporal networks in which certain temporal durations are beyond the con...
Luke Hunsberger
PKDD
2009
Springer
153views Data Mining» more  PKDD 2009»
14 years 3 months ago
Subspace Regularization: A New Semi-supervised Learning Method
Most existing semi-supervised learning methods are based on the smoothness assumption that data points in the same high density region should have the same label. This assumption, ...
Yan-Ming Zhang, Xinwen Hou, Shiming Xiang, Cheng-L...
KES
2005
Springer
14 years 2 months ago
A SVM Regression Based Approach to Filling in Missing Values
In KDD procedure, to fill in missing data typically requires a very large investment of time and energy - often 80% to 90% of a data analysis project is spent in making the data re...
Honghai Feng, Chen Guoshun, Yin Cheng, Bingru Yang...
AINA
2009
IEEE
14 years 2 months ago
Preference Ordering in Agenda Based Multi-issue Negotiation for Service Level Agreement
—This paper discusses multi-issue negotiation between agents such as providers and consumers in a group decision making environment. The outcome of such encounters depends on two...
Fahmida Abedin, Kuo-Ming Chao, Nick Godwin, Hisbel...
ATAL
2010
Springer
13 years 10 months ago
Risk-sensitive planning in partially observable environments
Partially Observable Markov Decision Process (POMDP) is a popular framework for planning under uncertainty in partially observable domains. Yet, the POMDP model is riskneutral in ...
Janusz Marecki, Pradeep Varakantham