Sciweavers

10890 search results - page 25 / 2178
» Automatic Complexity Analysis
Sort
View
RTA
2010
Springer
13 years 11 months ago
Modular Complexity Analysis via Relative Complexity
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
Harald Zankl, Martin Korp
ITP
2010
178views Mathematics» more  ITP 2010»
13 years 9 months ago
Interactive Termination Proofs Using Termination Cores
Recent advances in termination analysis have yielded new methods and tools that are highly automatic. However, when they fail, even experts have difficulty understanding why and de...
Panagiotis Manolios, Daron Vroon
FPL
2004
Springer
89views Hardware» more  FPL 2004»
14 years 28 days ago
HW/SW Co-design by Automatic Embedding of Complex IP Cores
Complex SoC and platform-based designs require integration of configurable IP cores from multiple sources. Even automatic compilation flows from a high-level description to HW/SW s...
Holger Lange, Andreas Koch
ICCBR
2005
Springer
14 years 1 months ago
On the Effectiveness of Automatic Case Elicitation in a More Complex Domain
Automatic case elicitation (ACE) is a learning technique in which a case-based reasoning system acquires knowledge automatically from scratch through repeated real-time trial and e...
Siva N. Kommuri, Jay H. Powell, John D. Hastings
ACL
2009
13 years 5 months ago
Do Automatic Annotation Techniques Have Any Impact on Supervised Complex Question Answering?
In this paper, we analyze the impact of different automatic annotation methods on the performance of supervised approaches to the complex question answering problem (defined in th...
Yllias Chali, Sadid A. Hasan, Shafiq R. Joty