Schema matching is one of the key challenges in information integration. It is a labor-intensive and time-consuming process. To alleviate the problem, many automated solutions have...
We study open-shop scheduling problems with job release times. The objective is to minimize the makespan. Dense schedules, easy to construct, are often used as approximate solutio...
In this paper, we present an approach that extends the Particle Swarm Optimization (PSO) algorithm to handle multiobjective optimization problems by incorporating the mechanism of...
We extend the results of [2] by computing conformal maps onto the canonical slit domains in Nehari [14]. Along the way, we demonstrate the computability of solutions to Neuman prob...
Using the solution of the one-sided exit problem, a procedure to price Parisian barrier options in a jump-diffusion model with two-sided exponential jumps is developed. By extendin...