Sciweavers

925 search results - page 36 / 185
» A Solution to the Extended GCD Problem
Sort
View
TKDE
2008
121views more  TKDE 2008»
13 years 7 months ago
Schema Matching Using Interattribute Dependencies
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...
Jaewoo Kang, Jeffrey F. Naughton
TCS
2008
13 years 7 months ago
Dense open-shop schedules with release times
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...
Rongjun Chen, Wanzhen Huang, Guochun Tang
GECCO
2005
Springer
228views Optimization» more  GECCO 2005»
14 years 1 months ago
An effective use of crowding distance in multiobjective particle swarm optimization
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...
Carlo R. Raquel, Prospero C. Naval Jr.
CCA
2009
Springer
14 years 2 months ago
Computing Conformal Maps onto Canonical Slit Domains
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...
Valentin V. Andreev, Timothy H. McNicholl
FS
2006
123views more  FS 2006»
13 years 7 months ago
American Parisian options
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...
Marc Chesney, Laurent Gauthier