2214 search results - page 385 / 443 » Complexity of Reasoning |
163
click to vote
PLDI
2012
ACM
13 years 5 months ago
2012
ACM
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
150
click to vote
SIGIR
2012
ACM
13 years 5 months ago
2012
ACM
Enterprise search is challenging for several reasons, notably the dynamic terminology and jargon that are specific to the enterprise domain. This challenge is partly addressed by...
118
click to vote
NETWORKING
2010
15 years 4 months ago
2010
Rate-Delay (RD) Network Services constitute a promising differentiated-services architecture for multi-provider networks, by offering users a choice between high throughput or low ...
142
click to vote
UAI
1997
15 years 4 months ago
1997
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
119
click to vote
ACL
1997
15 years 4 months ago
1997
We present preliminary results concerning robust techniques for resolving bridging definite descriptions. We report our analysis of a collection of 20 Wall Street Journal articles...