2313 search results - page 391 / 463 » On Heuristic Time Hierarchies |
178
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
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...
173
click to vote
JSSPP
2010
Springer
15 years 4 months ago
2010
Springer
We present the Dynamic Priority (DP) parallel task scheduler for Hadoop. It allows users to control their allocated capacity by adjusting their spending over time. This simple mech...
210
click to vote
SECON
2010
IEEE
15 years 4 months ago
2010
IEEE
Wireless communications over water may suffer from serious multipath fading due to strong specular reflections from conducting water surfaces. Cognitive radios enable dynamic spect...
167
click to vote
CASES
2009
ACM
15 years 4 months ago
2009
ACM
In this paper we address the issue of making a program reversible in terms of spatial complexity. Spatial complexity is the amount of memory/register locations required for perfor...
200
click to vote
ACCV
2010
Springer
15 years 1 months ago
2010
Springer
Recent work on early vision such as image segmentation, image restoration, stereo matching, and optical flow models these problems using Markov Random Fields. Although this formula...