257 search results - page 32 / 52 » A (Somewhat) New Solution to the Variable Binding Problem |
164
click to vote
IOR
2006
15 years 6 months ago
2006
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
167
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
Estimating relative camera motion from two views is a classical problem in computer vision. The minimal case for such problem is the so-called five-point-problem, for which the st...
203
click to vote
ICIC
2009
Springer
16 years 1 months ago
2009
Springer
Genetic Programming(GP) can obtain a program structure to solve complex problem. This paper presents a new form of Genetic Programming, Function Sequence Genetic Programming (FSGP)...
159
click to vote
ISSAC
2005
Springer
16 years 6 days ago
2005
Springer
Let G = (4y2 + 2z)x2 + (10y2 + 6z) be the greatest common divisor (gcd) of two polynomials A, B ∈ [x,y, z]. Because G is not monic in the main variable x, the sparse modular ...
175
click to vote
AAAI
2006
15 years 8 months ago
2006
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...