We investigate interchangeability of values in CSPs, based on an approach where a single value in the domain of a variable can be treated as a combination of “sub-values”. An ...
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
Abstract. In this paper, a real-life routing and scheduling problem encountered is addressed. The problem, which consists in optimizing the delivery of fluids by tank trucks on a ...
Many of today's problems are in search of new, innovative solutions. However, the development of new and innovative solutions has been elusive to many, resulting in considerab...
Jo Ann Lane, Barry W. Boehm, Mark T. Bolas, Azad M...