4719 search results - page 810 / 944 » Newtonian program analysis |
137
click to vote
MICAI
2005
Springer
15 years 10 months ago
2005
Springer
Although undirected cycles in directed graphs of Bayesian belief networks have been thoroughly studied, little attention has so far been given to a systematic analysis of directed ...
142
click to vote
OOPSLA
2005
Springer
15 years 10 months ago
2005
Springer
iven software product lines combine the abstraction capability of Model Driven Software Development (MDSD) and the variability management capability of Software Product Line Engin...
169
click to vote
STACS
2005
Springer
15 years 10 months ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
133
click to vote
ISSTA
2004
ACM
15 years 9 months ago
2004
ACM
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...
131
click to vote
SC
2004
ACM
15 years 9 months ago
2004
ACM
There exist many application classes for which the users have significant flexibility in the quality of output they desire. At the same time, there are other constraints, such a...