257 search results - page 32 / 52 » A (Somewhat) New Solution to the Variable Binding Problem |
IOR
2006
14 years 9 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...
ICPR
2006
IEEE
15 years 10 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...
90
Voted
ICIC
2009
Springer
15 years 4 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)...
74
Voted
ISSAC
2005
Springer
15 years 3 months 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 ...
85
Voted
AAAI
2006
14 years 11 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...