Sciweavers

2474 search results - page 305 / 495
» Solving Problems on Parallel Computers by Cellular Programmi...
Sort
View
IPPS
2010
IEEE
15 years 4 months ago
Large neighborhood local search optimization on graphics processing units
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Thé Van Luong, Nouredine Melab, El-Ghazali ...
ICRA
2009
IEEE
143views Robotics» more  ICRA 2009»
16 years 28 days ago
Least absolute policy iteration for robust value function approximation
Abstract— Least-squares policy iteration is a useful reinforcement learning method in robotics due to its computational efficiency. However, it tends to be sensitive to outliers...
Masashi Sugiyama, Hirotaka Hachiya, Hisashi Kashim...
ECCV
2010
Springer
15 years 11 months ago
MRF Inference by k-Fan Decomposition and Tight Lagrangian Relaxation
We present a novel dual decomposition approach to MAP inference with highly connected discrete graphical models. Decompositions into cyclic k-fan structured subproblems are shown t...
ACSC
2005
IEEE
15 years 8 months ago
Gradiance On-Line Accelerated Learning
Gradiance On-Line Accelerated Learning GOAL is a system for creating and automatically grading homeworks, programming laboratories, and tests. Through the concept of root questi...
Jeffrey D. Ullman
IPSN
2005
Springer
15 years 11 months ago
Avrora: scalable sensor network simulation with precise timing
— Simulation can be an important step in the development of software for wireless sensor networks and has been the subject of intense research in the past decade. While most prev...
Ben Titzer, Daniel K. Lee, Jens Palsberg