257 search results - page 2 / 52 » A (Somewhat) New Solution to the Variable Binding Problem |
ATMOS
2007
13 years 8 months ago
2007
In this paper we study a general formulation of the train platforming problem, which contains as special cases all the versions previously considered in the literature as well as a...
CPAIOR
2004
Springer
14 years 15 days ago
2004
Springer
To improve solution robustness, we introduce the concept of super solutions to constraint programming. An (a, b)-super solution is one in which if a variables lose their values, th...
ICFP
2001
ACM
14 years 7 months ago
2001
ACM
With few exceptions, macros have traditionally been viewed as operations on syntax trees or even on plain strings. This view makes macros seem ad hoc, and is at odds with two desi...
CEC
2009
IEEE
14 years 1 months ago
2009
IEEE
— Many real-world problems demand a feasible solution to satisfy physical equilibrium, stability, or certain properties which require an additional lower level optimization probl...
PPSN
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...