Sciweavers

388 search results - page 31 / 78
» A Mixed Closure-CSP Method to Solve Scheduling Problems
Sort
View
AUTOMATICA
2007
82views more  AUTOMATICA 2007»
13 years 9 months ago
Simulation-based optimal sensor scheduling with application to observer trajectory planning
The sensor scheduling problem can be formulated as a controlled hidden Markov model and this paper solves the problem when the state, observation and action spaces are continuous....
Sumeetpal S. Singh, Nikolaos Kantas, Ba-Ngu Vo, Ar...
DAC
1995
ACM
14 years 10 days ago
Conflict Modelling and Instruction Scheduling in Code Generation for In-House DSP Cores
Application domain specific DSP cores are becoming increasingly popular due to their advantageous trade–off between flexibility and cost. However, existing code generation metho...
Adwin H. Timmer, Marino T. J. Strik, Jef L. van Me...
AAAI
2012
11 years 11 months ago
MOMDPs: A Solution for Modelling Adaptive Management Problems
In conservation biology and natural resource management, adaptive management is an iterative process of improving management by reducing uncertainty via monitoring. Adaptive manag...
Iadine Chades, Josie Carwardine, Tara G. Martin, S...
ASPDAC
2000
ACM
154views Hardware» more  ASPDAC 2000»
14 years 1 months ago
Dynamic weighting Monte Carlo for constrained floorplan designs in mixed signal application
Simulated annealing has been one of the most popular stochastic optimization methods used in the VLSI CAD field in the past two decades for handling NP-hard optimization problems...
Jason Cong, Tianming Kong, Faming Liang, Jun S. Li...
CEC
2003
IEEE
14 years 2 months ago
Adaptive temperature schedule determined by genetic algorithm for parallel simulated annealing
Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...
Mitsunori Miki, Tomoyuki Hiroyasu, Jun'ya Wako, Ta...