Sciweavers

2273 search results - page 45 / 455
» On the Expressiveness and Complexity of ATL
Sort
View
INLG
2010
Springer
13 years 6 months ago
Complex Lexico-syntactic Reformulation of Sentences Using Typed Dependency Representations
We present a framework for reformulating sentences by applying transfer rules on a typed dependency representation. We specify a list of operations that the framework needs to sup...
Advaith Siddharthan
ISMIS
2003
Springer
14 years 1 months ago
Searching for the Complex Decision Reducts: The Case Study of the Survival Analysis
Generalization of the fundamental rough set discernibility tools aiming at searching for relevant patterns for complex decisions is discussed. As an example of application, there i...
Jan G. Bazan, Andrzej Skowron, Dominik Slezak, Jak...
ECAL
2001
Springer
14 years 1 months ago
Taxonomy in Alife. Measures of Similarity for Complex Artificial Organisms
In this paper a formal approach to construction of a similarity measure for complex creatures is presented. The simulation model is described, and a Framsticks agent is expressed i...
Maciej Komosinski, Marek Kubiak
FPCA
1989
14 years 17 days ago
Automatic Complexity Analysis
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...
Mads Rosendahl
CIDR
2003
123views Algorithms» more  CIDR 2003»
13 years 10 months ago
Managing Expressions as Data in Relational Database Systems
A wide-range of applications, including Publish/Subscribe, Workflow, and Web-site Personalization, require maintaining user’s interest in expected data as conditional expression...
Aravind Yalamanchi, Jagannathan Srinivasan, Dieter...