Sciweavers

4524 search results - page 134 / 905
» The Complexity of Global Constraints
Sort
View
SI3D
2009
ACM
15 years 7 months ago
Approximating dynamic global illumination in image space
Physically plausible illumination at real-time framerates is often achieved using approximations. One popular example is ambient occlusion (AO), for which very simple and efficie...
Tobias Ritschel, Thorsten Grosch, Hans-Peter Seide...
AAAI
2007
15 years 3 months ago
Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry
We consider problems of geometric exploration and selfdeployment for simple robots that can only sense the combinatorial (non-metric) features of their surroundings. Even with suc...
Subhash Suri, Elias Vicari, Peter Widmayer
CEC
2007
IEEE
15 years 2 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
241
Voted
ECAI
2010
Springer
15 years 1 months ago
Bayesian Monte Carlo for the Global Optimization of Expensive Functions
In the last decades enormous advances have been made possible for modelling complex (physical) systems by mathematical equations and computer algorithms. To deal with very long run...
Perry Groot, Adriana Birlutiu, Tom Heskes
76
Voted
JCSS
2007
68views more  JCSS 2007»
15 years 19 days ago
Portfolio and investment risk analysis on global grids
The financial services industry today produces and consumes huge amounts of data and the processes involved in analysing these data are equally huge especially in terms of their c...
Rafael Moreno-Vozmediano, Krishna Nadiminti, Sriku...