16666 search results - page 2922 / 3334 » Descriptive and Computational Complexity |
185
click to vote
UAI
2004
15 years 8 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...
213
click to vote
ISCAPDCS
2003
15 years 8 months ago
2003
The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whene...
176
click to vote
WOA
2001
15 years 8 months ago
2001
Observation is becoming a crucial issue in the engineering of today's systems: the common practice for dealing with their complexity is to encapsulate their subcomponents abs...
206
click to vote
WSC
2004
15 years 8 months ago
2004
While the literature contains several adaptive sampling techniques for statistical comparison of competing simulated system configurations and for embedded statistical computation...
126
click to vote
WSC
2004
15 years 8 months ago
2004
Simulation composability is a difficult capability to achieve due to the challenges of creating components, selecting combinations of components, and integrating the selected comp...