Sciweavers

4908 search results - page 138 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
KR
2010
Springer
15 years 11 months ago
Worst-Case Optimal Reasoning for the Horn-DL Fragments of OWL 1 and 2
Horn fragments of Description Logics (DLs) have gained popularity because they provide a beneficial trade-off between expressive power and computational complexity and, more spec...
Magdalena Ortiz, Sebastian Rudolph, Mantas Simkus
EUROPAR
2010
Springer
15 years 6 months ago
Source-to-Source Optimization of CUDA C for GPU Accelerated Cardiac Cell Modeling
Large and complex systems of ordinary differential equations (ODEs) arise in diverse areas of science and engineering, and pose special challenges on a streaming processor owing to...
Fred V. Lionetti, Andrew D. McCulloch, Scott B. Ba...
4OR
2008
43views more  4OR 2008»
15 years 6 months ago
Optimal treatments for photodynamic therapy
Photodynamic therapy is a complex treatment for neoplastic diseases that uses the light-harvesting properties of a photosensitizer. The treatment depends on the amount of photosen...
A. Holder, D. Llagostera
CEC
2007
IEEE
15 years 8 months ago
Hybrid optimization using DIRECT, GA, and SQP for global exploration
— As there are many good optimization algorithms each with its own characteristics, it is very difficult to choose the best method for optimization problems. Thus, it is importa...
Satoru Hiwa, Tomoyuki Hiroyasu, Mitsunori Miki
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
15 years 10 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu