1306 search results - page 218 / 262 » A Diagrammatic Approach to Model Completion |
148
click to vote
IJCAI
2007
15 years 7 months ago
2007
Local search procedures for solving satisfiability problems have attracted considerable attention since the development of GSAT in 1992. However, recent work indicates that for m...
152
click to vote
AAAI
2004
15 years 7 months ago
2004
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance boo...
174
click to vote
FLAIRS
2004
15 years 7 months ago
2004
er provides new techniques for abstracting the state space of a Markov Decision Process (MDP). These techniques extend one of the recent minimization models, known as -reduction, ...
205
click to vote
COOTS
2001
15 years 7 months ago
2001
Many authors have proposed using byte code rewriting as a way of adapting or extending the behaviour of Java There are toolkits available that simplify this process and raise the ...
163
click to vote
IC
2003
15 years 7 months ago
2003
Abstract— In this paper, we develop methods to “sample” a large real network into a small realistic graph. Although topology modeling has received a lot attention lately, it ...