2268 search results - page 190 / 454 » The Essence of Form Abstraction |
151
click to vote
CAV
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Solvers for satisfiability modulo theories (SMT) check the satisfiability of first-order formulas containing operations from various theories such as the Booleans, bit-ve...
101
click to vote
CP
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. In this paper we investigate the ways in which a fixed collection of valued constraints can be combined to express other valued constraints. We show that in some cases a ...
142
click to vote
ECML
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We present a new reinforcement learning approach for deterministic continuous control problems in environments with unknown, arbitrary reward functions. The difficulty of...
116
Voted
ANTS
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We answer a question asked by Hajdu and Tengely: The only arithmetic progression in coprime integers of the form (a2 , b2 , c2 , d5 ) is (1, 1, 1, 1). For the proof, we ...
126
click to vote
SAT
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Preprocessing has proven important in enabling efficient Boolean satisfiability (SAT) solving. For many real application scenarios of SAT it is important to be able to ...