Sciweavers

3907 search results - page 119 / 782
» Time, Knowledge, and Choice
Sort
View
FAW
2009
Springer
180views Algorithms» more  FAW 2009»
15 years 11 months ago
Edge Search Number of Cographs in Linear Time
We give a linear-time algorithm for computing the edge search number of cographs, thereby proving that this problem can be solved in polynomial time on this graph class. With our ...
Pinar Heggernes, Rodica Mihai
UAI
1997
15 years 5 months ago
Time-Critical Action: Representations and Application
We review the problem of time-critical action and discuss a reformulation that shifts knowledge acquisition from the assessment of complex temporal probabilistic dependencies to t...
Eric Horvitz, Adam Seiver
ACSC
2006
IEEE
15 years 10 months ago
Using formal concept analysis with an incremental knowledge acquisition system for web document management
It is necessary to provide a method to store Web information effectively so it can be utilised as a future knowledge resource. A commonly adopted approach is to classify the retri...
Timothy J. Everts, Sung Sik Park, Byeong Ho Kang
IJMMS
2007
163views more  IJMMS 2007»
15 years 4 months ago
Beyond ontologies: Toward situated representations of scientific knowledge
: In information systems that support knowledge-discovery applications such as scientific exploration, reliance on highly structured ontologies as data-organization aids can be lim...
William Pike, Mark Gahegan
CI
2005
106views more  CI 2005»
15 years 4 months ago
Incremental Learning of Procedural Planning Knowledge in Challenging Environments
Autonomous agents that learn about their environment can be divided into two broad classes. One class of existing learners, reinforcement learners, typically employ weak learning ...
Douglas J. Pearson, John E. Laird