536 search results - page 60 / 108 » A Translational Approach to Constraint Answer Set Solving |
160
click to vote
ADAEUROPE
1998
Springer
15 years 8 months ago
1998
Springer
This paper describes an automated approach for generating Ada bindings from Java class files. We start with the set of Java features that require a visible Ada binding, and an Ada ...
145
click to vote
DEXA
2003
Springer
15 years 9 months ago
2003
Springer
Emerging applications using miniature electronic devices (e.g., tracking mobile objects using sensors) generate very large amounts of highly dynamic data that poses very high overh...
126
click to vote
DASFAA
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract. In this paper, we propose a novel preference-constrained approach to k-anonymisation. In contrast to the existing works on kanonymisation which attempt to satisfy a minim...
126
click to vote
AUSAI
2007
Springer
15 years 7 months ago
2007
Springer
Planning as satisfiability is a powerful approach to solving domain independent planning problems. In this paper, we consider a relaxed semantics for plans with parallel operator a...
116
Voted
ICTAI
2007
IEEE
15 years 10 months ago
2007
IEEE
Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that portfolios of backtracking algorith...