2286 search results - page 339 / 458 » Algorithms for Categorical Equivalence |
167
click to vote
SERVICES
2008
15 years 8 months ago
2008
In Service Oriented Architecture, each application is ofgned as a set of abstract services, which defines its functions. A concrete service(s) is selected at runtime for tract ser...
191
click to vote
UAI
2008
15 years 8 months ago
2008
Graphical models are usually learned without regard to the cost of doing inference with them. As a result, even if a good model is learned, it may perform poorly at prediction, be...
199
click to vote
FLAIRS
2004
15 years 8 months ago
2004
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
196
click to vote
IJCAI
2001
15 years 8 months ago
2001
A new, general approach is described for approximate inference in first-order probabilistic languages, using Markov chain Monte Carlo (MCMC) techniques in the space of concrete po...
164
click to vote
SIROCCO
2004
15 years 8 months ago
2004
Path Layout is a fundamental graph problem in label switching protocols. This problem is raised in various protocols such as the traditional ATM protocol and MPLS which is a new l...