257 search results - page 8 / 52 » A (Somewhat) New Solution to the Variable Binding Problem |
AAAI
2004
14 years 11 months ago
2004
We study local interchangeability of values in constraint networks based on a new approach where a single value in the domain of a variable can be treated as a combination of &quo...
ATAL
2007
Springer
15 years 3 months ago
2007
Springer
We develop a new graphical representation for interactive partially observable Markov decision processes (I-POMDPs) that is significantly more transparent and semantically clear t...
IPPS
2002
IEEE
15 years 2 months ago
2002
IEEE
Multiple memory module architecture enjoys higher memory access bandwidth and thus higher performance. Two key problems in gaining high performance in this kind of architecture ar...
SIAMJO
2000
14 years 9 months ago
2000
Abstract. We consider column sufficient linear complementarity problems and study the problem of identifying those variables that are zero at a solution. To this end we propose a n...
COR
2010
14 years 9 months ago
2010
In this paper we propose a new hybrid heuristic for solving 0-1 mixed integer programs based on the principle of variable neighbourhood decomposition search. It combines variable ...