Sciweavers

1581 search results - page 118 / 317
» Domain semantics of possibility computations
Sort
View
151
Voted
DLOG
2010
15 years 1 months ago
Automata-Based Abduction for Tractable Diagnosis
Abstract. Abductive reasoning has been recognized as a valuable complement to deductive inference for tasks such as diagnosis and integration of incomplete information despite its ...
Thomas Hubauer, Steffen Lamparter, Michael Pirker
155
Voted
COLING
2002
15 years 3 months ago
Learning Question Classifiers
In order to respond correctly to a free form factual question given a large collection of texts, one needs to understand the question to a level that allows determining some of th...
Xin Li, Dan Roth
135
Voted
RTAS
2009
IEEE
15 years 10 months ago
Partial Program Admission
Abstract—Real-time systems on non-preemptive platforms require a means of bounding the execution time of programs for admission purposes. Worst-Case Execution Time (WCET) is most...
Michael Wilson, Ron Cytron, Jonathan S. Turner
SEMCO
2008
IEEE
15 years 10 months ago
Mobile Mashups: Thoughts, Directions, and Challenges
The twin mainstream computing shifts of mobility and programable Web are fundamentally impacting how humans interact, socialize, and access information. Never before has computing...
E. Michael Maximilien
136
Voted
JFP
2000
91views more  JFP 2000»
15 years 3 months ago
Uniform confluence in concurrent computation
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
Joachim Niehren