2080 search results - page 367 / 416 » Measuring empirical computational complexity |
147
click to vote
MSV
2004
15 years 7 months ago
2004
Valid models are central to the existence of Computer science as in most other disciplines, but at what point can one say that a model is valid and hence correct? is often taken t...
171
click to vote
UAI
2004
15 years 7 months ago
2004
Generalized belief propagation (GBP) has proven to be a promising technique for approximate inference tasks in AI and machine learning. However, the choice of a good set of cluste...
165
click to vote
OPODIS
2003
15 years 7 months ago
2003
A fundamental problem in distributed computing is performing a set despite failures and delays. Stated abstractly, the problem is to perform N tasks using P failure-prone processor...
164
click to vote
AAAI
2000
15 years 7 months ago
2000
Rational decision making requires full knowledge of the utility function of the person affected by the decisions. However, in many cases, the task of acquiring such knowledge is n...
174
click to vote
WSC
1997
15 years 7 months ago
1997
Components of modern parallel systems are becoming quite complex with many features and variations. An integrated modeling of these components (interconnection network, messaging ...