1144 search results - page 183 / 229 » Fractal Algorithm for Finding Global Optimal Solution |
STOC
2009
ACM
15 years 10 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
75
Voted
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
— Multi-agent coordination problems can be cast as distributed optimization tasks. Probability Collectives (PCs) are techniques that deal with such problems in discrete and conti...
CDC
2009
IEEE
14 years 10 months ago
2009
IEEE
We consider the problem of selecting a subset of p out of n sensors for the purpose of event detection, in a wireless sensor network (WSN). Occurrence or not of the event of intere...
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
RT
2004
Springer
15 years 3 months ago
2004
Springer
With the advancements in realtime ray tracing and new global illumination algorithms we are now able to render the most important illumination effects at interactive rates. One of...