Sciweavers

908 search results - page 111 / 182
» Heuristic Methods for Solving Job-Shop Scheduling Problems
Sort
View
146
Voted
ICCAD
2009
IEEE
131views Hardware» more  ICCAD 2009»
15 years 1 months ago
Scheduling with soft constraints
In a behavioral synthesis system, a typical approach used to guide the scheduler is to impose hard constraints on the relative timing between operations considering performance, a...
Jason Cong, Bin Liu, Zhiru Zhang
GECCO
2009
Springer
15 years 10 months ago
An evolutionary approach to planning IEEE 802.16 networks
Efficient and effective deployment of IEEE 802.16 networks to service an area of users with certain traffic demands is an important network planning problem. We resort to an evol...
Ting Hu, Yuanzhu Peter Chen, Wolfgang Banzhaf, Rob...
141
Voted
GECCO
2007
Springer
209views Optimization» more  GECCO 2007»
15 years 9 months ago
An online implementable differential evolution tuned optimal guidance law
This paper proposes a novel application of differential evolution to solve a difficult dynamic optimisation or optimal control problem. The miss distance in a missile-target engag...
Raghunathan Thangavelu, S. Pradeep
TIME
2002
IEEE
15 years 8 months ago
Applying Local Search to Temporal Reasoning
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...
John Thornton, Matthew Beaumont, Abdul Sattar, Mic...
FOCM
2011
175views more  FOCM 2011»
14 years 10 months ago
Convergence of Fixed-Point Continuation Algorithms for Matrix Rank Minimization
The matrix rank minimization problem has applications in many fields such as system identification, optimal control, low-dimensional embedding etc. As this problem is NP-hard in ...
Donald Goldfarb, Shiqian Ma