Sciweavers

4935 search results - page 12 / 987
» An Adaptive Supersampling Method
Sort
View
IS
2011
13 years 3 months ago
Fully dynamic metric access methods based on hyperplane partitioning
Metric access methods based on hyperplane partitioning have the advantage, compared to the ballpartitioning-based ones, that regions do not overlap. The price is less flexibility...
Gonzalo Navarro, Roberto Uribe Paredes
CPAIOR
2011
Springer
13 years 7 days ago
Optimization Methods for the Partner Units Problem
In this work we present the Partner Units Problem as a novel challenge for optimization methods. It captures a certain type of configuration problem that frequently occurs in indu...
Markus Aschinger, Conrad Drescher, Gerhard Friedri...
GEM
2009
13 years 6 months ago
Evolutionary Methods in Self-organizing System Design
Self-organizing systems could serve as a solution for many technical problems where properties like robustness, scalability, and adaptability are required. However, despite all the...
Istvan Fehervari, Wilfried Elmenreich
ICAL
2011
301views more  ICAL 2011»
12 years 8 months ago
On the LVI-based numerical method (E47 algorithm) for solving quadratic programming problems
— In this paper, a numerical method (termed, E47 algorithm) based on linear variational inequalities (LVI) is presented and investigated to solve quadratic programming (QP) probl...
Yunong Zhang, Senbo Fu, Zhijun Zhang, Lin Xiao, Xu...
FUIN
2010
102views more  FUIN 2010»
13 years 6 months ago
Efficient Plan Adaptation through Replanning Windows and Heuristic Goals
Fast plan adaptation is important in many AI-applications. From a theoretical point of view, in the worst case adapting an existing plan to solve a new problem is no more efficien...
Alfonso Gerevini, Ivan Serina