In this paper we describe a paradigm for contentfocused matchmaking, based on a recently proposed model for constraint acquisition-and-satisfaction. Matchmaking agents are conceiv...
It is well known that any non-binary discrete constraint satisfaction problem (CSP) can be translated into an equivalent binary CSP. Two translations are known: the dual graph tra...
Abstract Resource adaptlvity" Because the sets of strucNatural language parsing is conceived to be a procedure of disambiguation, which successively reduces an initially total...
The problem of integrating information from con icting sources comes up in many current applications, such as cooperative information systems, heterogeneous databases, and multi-a...
In this paper, the problem of how to better estimate spatially adaptive intensity bounds for image restoration is addressed. When the intensity bounds are estimated from a degrade...
Kaaren May, Tania Stathaki, Anthony G. Constantini...