Sciweavers

11740 search results - page 55 / 2348
» More Problems in Rewriting
Sort
View
AAAI
2004
13 years 11 months ago
Making Argumentation More Believable
There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conflicting ar...
Anthony Hunter
RTA
2010
Springer
14 years 1 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
GECCO
2007
Springer
189views Optimization» more  GECCO 2007»
14 years 4 months ago
A more bio-plausible approach to the evolutionary inference of finite state machines
With resemblance of finite-state machines to some biological mechanisms in cells and numerous applications of finite automata in different fields, this paper uses analogies an...
Hooman Shayani, Peter J. Bentley
APLAS
2006
ACM
14 years 3 months ago
A Fine-Grained Join Point Model for More Reusable Aspects
Abstract. We propose a new join point model for aspect-oriented programming (AOP) languages. In most AOP languages including AspectJ, a join point is a time interval of an action i...
Hidehiko Masuhara, Yusuke Endoh, Akinori Yonezawa
CHI
1996
ACM
14 years 2 months ago
Using Small Screen Space More Efficiently
: This paper describes techniques for maximizing the efficient use of small screen space by combining delayed response with semi-transparency of control objects ("widgets"...
Tomonari Kamba, Shawn A. Elson, Terry Harpold, Tim...