Sciweavers

299 search results - page 22 / 60
» Dispositional implementation solves the superfluous structur...
Sort
View
4OR
2006
99views more  4OR 2006»
13 years 8 months ago
A decomposition-based solution method for stochastic mixed integer nonlinear programs
This is a summary of the main results presented in the author's PhD thesis, supervised by D. Conforti and P. Beraldi and defended on March 2005. The thesis, written in English...
Maria Elena Bruni
CGF
2006
155views more  CGF 2006»
13 years 8 months ago
Opacity Peeling for Direct Volume Rendering
The most important technique to visualize 3D scalar data, as they arise e.g. in medicine from tomographic measurement, is direct volume rendering. A transfer function maps the sca...
Christof Rezk-Salama, Andreas Kolb
ESA
2006
Springer
125views Algorithms» more  ESA 2006»
13 years 10 months ago
Purely Functional Worst Case Constant Time Catenable Sorted Lists
We present a purely functional implementation of search trees that requires O(log n) time for search and update operations and supports the join of two trees in worst case constant...
Gerth Stølting Brodal, Christos Makris, Kos...
JCST
2010
198views more  JCST 2010»
13 years 3 months ago
Certification of Thread Context Switching
With recent efforts to build foundational certified software systems, two different approaches have been proposed to certify thread context switching. One is to certify both thread...
Yu Guo, Xinyu Jiang, Yiyun Chen
AUSAI
2008
Springer
13 years 10 months ago
Constraint-Based Multi-agent Path Planning
Planning collision-free paths for multiple robots traversing a shared space is a problem that grows combinatorially with the number of robots. The naive centralised approach soon ...
Malcolm Ryan