257 search results - page 4 / 52 » A (Somewhat) New Solution to the Variable Binding Problem |
DAM
2007
14 years 11 months ago
2007
Determining the maximum number of D-dimensional spheres of radius r that can be adjacent to a central sphere of radius r is known as the Kissing Number Problem (KNP). The problem ...
MP
2002
14 years 11 months ago
2002
We consider a class of non-linear mixed integer programs with n integer variables and k continuous variables. Solving instances from this class to optimality is an NP-hard problem....
133
click to vote
SAS
1994
Springer
15 years 3 months ago
1994
Springer
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
CP
2007
Springer
15 years 5 months ago
2007
Springer
In this paper we present new techniques for improving backtracking based Quantified Constraint Satisfaction Problem (QCSP) solvers. QCSP is a generalization of CSP in which variab...
90
Voted
CORR
2004
Springer
14 years 11 months ago
2004
Springer
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framewo...