Sciweavers

5244 search results - page 403 / 1049
» Structural Complexity of AvgBPP
Sort
View
200
Voted
DLOG
2010
15 years 4 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
209
Voted
PAAMS
2010
Springer
15 years 4 months ago
Agent-Based AmI System Case Study: The Easy Line + Project
Abstract. Smart environments include context-aware computing to enhance system capabilities which affect user interaction positively. A context-aware application should collect con...
Armando Roy Delgado, Rubén Blasco Mar&iacut...
EXACT
2009
15 years 4 months ago
Towards the Explanation of Workflows
Across many fields involving complex computing, software systems are being augmented with workflow logging functionality. The log data can be effectively organized using declarativ...
James Michaelis, Li Ding, Deborah L. McGuinness
192
Voted
ICSE
2009
IEEE-ACM
15 years 4 months ago
Software Assumptions Failure Tolerance: Role, Strategies, and Visions
Abstract. At our behest or otherwise, while our software is being executed, a huge variety of design assumptions is continuously matched with the truth of the current condition. Wh...
Vincenzo De Florio
206
Voted
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 4 months ago
Schaefer's theorem for graphs
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Manuel Bodirsky, Michael Pinsker