1940 search results - page 211 / 388 » Graph Transformation with Variables |
165
click to vote
UAI
2007
15 years 5 months ago
2007
The traditional approach to building Bayesian networks is to build the graphical structure using a graphical editor and then add probabilities using a separate spreadsheet for eac...
160
click to vote
SIGSOFT
2003
ACM
15 years 9 months ago
2003
ACM
Most applications developed today rely on a given middleware platform which governs the interaction between components, the access to resources, etc. To decide, which platform is ...
171
click to vote
PODC
2009
ACM
16 years 4 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
134
click to vote
SOFSEM
2007
Springer
15 years 10 months ago
2007
Springer
Prior algorithms known for exactly solving Max 2-Sat improve upon the trivial upper bound only for very sparse instances. We present new algorithms for exactly solving (in fact, c...
138
click to vote
SAC
2004
ACM
15 years 9 months ago
2004
ACM
This paper presents a local search algorithm based on variable depth search, called the k-opt local search, for the maximum clique problem. The k-opt local search performs add and...