Sciweavers

1650 search results - page 228 / 330
» The HOM problem is decidable
Sort
View
MLCW
2005
Springer
15 years 12 months ago
Evaluating Predictive Uncertainty Challenge
This Chapter presents the PASCAL1 Evaluating Predictive Uncertainty Challenge, introduces the contributed Chapters by the participants who obtained outstanding results, and provide...
Joaquin Quiñonero Candela, Carl Edward Rasm...
KR
1998
Springer
15 years 10 months ago
Combining Narratives
A theory is elaboration tolerant to the extent that new information can be incorporated with only simple changes. The simplest change is conjoining new information, and only conju...
John McCarthy, Tom Costello
CSL
2009
Springer
15 years 10 months ago
Fixed-Point Definability and Polynomial Time
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...
Martin Grohe
IDMS
2000
Springer
128views Multimedia» more  IDMS 2000»
15 years 10 months ago
Fast and Optimal Multicast-Server Selection Based on Receivers' Preference
Abstract. In this paper, we propose static and dynamic server selection techniques for multicast receivers who receive multiple streams from replicated servers. In the proposed sta...
Akihito Hiromori, Hirozumi Yamaguchi, Keiichi Yasu...
AAAI
2008
15 years 8 months ago
A Scalable Jointree Algorithm for Diagnosability
Diagnosability is an essential property that determines how accurate any diagnostic reasoning can be on a system given any sequence of observations. An unobservable fault event in...
Anika Schumann, Jinbo Huang