Sciweavers

17471 search results - page 3139 / 3495
» Information Modeling
Sort
View
SODA
2000
ACM
123views Algorithms» more  SODA 2000»
15 years 8 months ago
Communication complexity of document exchange
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...
Graham Cormode, Mike Paterson, Süleyman Cenk ...
VIP
2000
15 years 8 months ago
Graphically Defining Articulable Tacit Knowledge
Although codified knowledge and its capture is commonplace, tacit knowledge has up until recent years proved elusive in its inclusion within the organisation's knowledge base...
Peter Busch, Debbie Richards
PDPTA
1997
15 years 8 months ago
Hazard-Free Connection Release
Abstract Fault-tolerant communication in a distributed system requires reliable connection management and message delivery. Reliable connection management includes the guarantee of...
Jennifer E. Walter, Jennifer L. Welch
AAAI
1996
15 years 8 months ago
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
Craig Boutilier, David Poole
AAAI
1996
15 years 8 months ago
An Optimal Contracting Strategy in a Digital Library
Agents can benefit from contracting some of their tasks that cannot be performedby themselves or that can be performed moreefficiently by other agents. Developing an agent's ...
Sunju Park, Edmund H. Durfee
« Prev « First page 3139 / 3495 Last » Next »