Sciweavers

1242 search results - page 88 / 249
» A Computational Complexity Theory in Membrane Computing
Sort
View
CHI
1999
ACM
15 years 2 months ago
Footprints: History-Rich Tools for Information Foraging
Inspired by Hill and Hollan’s original work [6], we have been developing a theory of interaction history and building tools to apply this theory to navigation in a complex infor...
Alan Wexelblat, Pattie Maes
AAAI
2006
14 years 11 months ago
Forgetting and Conflict Resolving in Disjunctive Logic Programming
We establish a declarative theory of forgetting for disjunctive logic programs. The suitability of this theory is justified by a number of desirable properties. In particular, one...
Thomas Eiter, Kewen Wang
CORR
2010
Springer
135views Education» more  CORR 2010»
14 years 10 months ago
Bounded Rationality, Strategy Simplification, and Equilibrium
It is frequently suggested that predictions made by game theory could be improved by considering computational restrictions when modeling agents. Under the supposition that player...
Hubie Chen
DISOPT
2011
201views Education» more  DISOPT 2011»
14 years 1 months ago
The Wiener maximum quadratic assignment problem
We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional poi...
Eranda Çela, Nina S. Schmuck, Shmuel Wimer,...
AIMS
2009
Springer
15 years 4 months ago
Knowledge Management and Promises
Ontological modelling for machine inference has featured prominently in IT management research recently, but there is more immediate scope for knowledge modelling in the realm of h...
Mark Burgess