Sciweavers

2703 search results - page 390 / 541
» Working Class Hero
Sort
View
UAI
2003
13 years 11 months ago
Exploiting Locality in Searching the Web
Published experiments on spidering the Web suggest that, given training data in the form of a (relatively small) subgraph of the Web containing a subset of a selected class of tar...
Joel Young, Thomas Dean
ICIS
2000
13 years 11 months ago
A framework of knowledge management systems: issues and challenges for theory and practice
As the basis of value creation increasingly depends on the leverage of the intangible assets of firms, Knowledge Management Systems (KMS) are emerging as powerful sources of compe...
Jungpil Hahn, Mani R. Subramani
ICMAS
2000
13 years 11 months ago
Reasoning About Others: Representing and Processing Infinite Belief Hierarchies
In this paper we focus on the problem of how infinite belief hierarchies can be represented and reasoned with in a computationally tractable way. When modeling nested beliefs one ...
Sviatoslav Brainov, Tuomas Sandholm
ICMAS
2000
13 years 11 months ago
The Computational Complexity of Agent Design Problems
This paper investigates the computational complexity of a fundamental problem in multi-agent systems: given an environment together with a specification of some task, can we const...
Michael Wooldridge
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
13 years 11 months ago
Typical random 3-SAT formulae and the satisfiability threshold
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
Olivier Dubois, Yacine Boufkhad, Jacques Mandler