595 search results - page 75 / 119 » Using Constraints with Memory to Implement Variable Eliminat... |
138
click to vote
CADE
2005
Springer
16 years 3 months ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
158
click to vote
SIAMJO
2002
15 years 2 months ago
2002
Abstract. Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective...
145
click to vote
DAMON
2007
Springer
15 years 9 months ago
2007
Springer
In this work, we research the suitability of the Cell Broadband Engine for database processing. We start by outlining the main architectural features of Cell and use microbenchmar...
158
click to vote
AI
2011
Springer
14 years 10 months ago
2011
Springer
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
153
click to vote
ASAP
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--Polynomial approximation is a very general technique for the evaluation of a wide class of numerical functions of one variable. This article details an architecture gener...