Sciweavers

14739 search results - page 97 / 2948
» An optimization problem on the sphere
Sort
View
DPD
1998
117views more  DPD 1998»
14 years 9 months ago
Solving Local Cost Estimation Problem for Global Query Optimization in Multidatabase Systems
To meet users’ growing needs for accessing pre-existing heterogeneous databases, a multidatabase system (MDBS) integrating multiple databases has attracted many researchers recen...
Qiang Zhu, Per-Åke Larson
ICALP
2005
Springer
15 years 3 months ago
The Tree Inclusion Problem: In Optimal Space and Faster
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
Philip Bille, Inge Li Gørtz
VECPAR
2004
Springer
15 years 3 months ago
Domain Decomposition Methods for PDE Constrained Optimization Problems
Abstract. Optimization problems constrained by nonlinear partial differential equations have been the focus of intense research in scientific computing lately. Current methods for...
Ernesto E. Prudencio, Richard H. Byrd, Xiao-Chuan ...
ESCIENCE
2007
IEEE
15 years 1 months ago
Grid-Enabling an Efficient Algorithm for Demanding Global Optimization Problems in Genetic Analysis
Abstract. We study the implementation on grid systems of an efficient algorithm for demanding global optimization problems. Specifically, we consider problems arising in the geneti...
Mahen Jayawardena, Sverker Holmgren
EOR
2007
117views more  EOR 2007»
14 years 10 months ago
Approximation of min-max and min-max regret versions of some combinatorial optimization problems
This paper investigates, for the first time in the literature, the approximation of minmax (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...