Sciweavers

544 search results - page 68 / 109
» Improving Local Search for Fuzzy Scheduling Problems
Sort
View
CP
2000
Springer
14 years 8 days ago
Optimal Anytime Constrained Simulated Annealing for Constrained Global Optimization
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
Benjamin W. Wah, Yixin Chen
IJCAI
2007
13 years 9 months ago
Estimating the Rate of Web Page Updates
Estimating the rate of Web page updates helps in improving the Web crawler’s scheduling policy. But, most of the Web sources are autonomous and updated independently. Clients li...
Sanasam Ranbir Singh
RTS
2011
131views more  RTS 2011»
13 years 2 months ago
Global scheduling based reliability-aware power management for multiprocessor real-time systems
Reliability-aware power management (RAPM) has been a recent research focus due the negative effects of the popular power management technique dynamic voltage and frequency scaling ...
Xuan Qi, Dakai Zhu, Hakan Aydin
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
13 years 9 months ago
Collective intelligence and bush fire spotting
Bush fires cause major damage each year in many areas of the world and the earlier that they can be detected the easier it is to minimize this damage. This paper describes a coll...
David Howden, Tim Hendtlass
PC
2010
196views Management» more  PC 2010»
13 years 6 months ago
Solving path problems on the GPU
We consider the computation of shortest paths on Graphic Processing Units (GPUs). The blocked recursive elimination strategy we use is applicable to a class of algorithms (such as...
Aydin Buluç, John R. Gilbert, Ceren Budak