Sciweavers

8196 search results - page 295 / 1640
» Computational Modeling and Complexity Science
Sort
View
IFIP
2004
Springer
16 years 2 hour ago
Tailoring Recursion to Characterize Non-Deterministic Complexity Classes over Arbitrary Structures
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We ...
Olivier Bournez, Felipe Cucker, Paulin Jacob&eacut...
IJCAI
1989
15 years 7 months ago
Reconstructive Explanation: Explanation as Complex Problem Solving
Existing explanation facilities are typically far more appropriate for knowledge engineers engaged in system maintenance than for endusers of the system. This is because the expla...
Michael R. Wick, William B. Thompson
IANDC
2006
83views more  IANDC 2006»
15 years 6 months ago
Implicit complexity over an arbitrary structure: Quantifier alternations
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We...
Olivier Bournez, Felipe Cucker, Paulin Jacob&eacut...
AI
2005
Springer
15 years 6 months ago
The complexity of contract negotiation
The use of software agents for automatic contract negotiation in e-commerce and e-trading ents has been the subject of considerable recent interest. A widely studied abstract mode...
Paul E. Dunne, Michael Wooldridge, Michael Laurenc...
IWPC
2010
IEEE
15 years 5 months ago
A Simple and Effective Measure for Complex Low-Level Dependencies
The measure dep-degree is a simple indicator for structural problems and complex dependencies on code-level. We model low-level dependencies between program operations as use-def ...
Dirk Beyer, Ashgan Fararooy