Sciweavers

2490 search results - page 419 / 498
» Complexity of Contextual Reasoning
Sort
View
PARA
1995
Springer
15 years 1 months ago
A Proposal for a Set of Parallel Basic Linear Algebra Subprograms
This paper describes a proposal for a set of Parallel Basic Linear Algebra Subprograms PBLAS. The PBLAS are targeted at distributed vector-vector, matrix-vector and matrixmatrix...
Jaeyoung Choi, Jack Dongarra, Susan Ostrouchov, An...
SAS
1995
Springer
127views Formal Methods» more  SAS 1995»
15 years 1 months ago
Complementation in Abstract Interpretation
ntation in Abstract Interpretation AGOSTINO CORTESI Universit`a di Venezia GILBERTO FIL´E Universit`a di Padova ROBERTO GIACOBAZZI Universit`a di Pisa CATUSCIA PALAMIDESSI Univers...
Agostino Cortesi, Gilberto Filé, Roberto Gi...
AIIDE
2008
15 years 11 days ago
Recombinable Game Mechanics for Automated Design Support
Systems that provide automated game-design support-whether fully automated game generators, or tools to assist human designers--must be able to maintain a representation of a game...
Mark J. Nelson, Michael Mateas
AVI
2008
15 years 11 days ago
The need for an interaction cost model in adaptive interfaces
The development of intelligent assistants has largely benefited from the adoption of decision-theoretic (DT) approaches that enable an agent to reason and account for the uncertai...
Bowen Hui, Sean Gustafson, Pourang Irani, Craig Bo...
CPAIOR
2008
Springer
14 years 12 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann