Sciweavers

657 search results - page 80 / 132
» Polynomial Time Algorithms for Minimum Energy Scheduling
Sort
View
EOR
2008
110views more  EOR 2008»
14 years 12 months ago
Runway sequencing with holding patterns
We study a scheduling problem, motivated by air-traffic control, in which a set of aircrafts are about to land on a single runway. When coming close to the landing area of the air...
Konstantin Artiouchine, Philippe Baptiste, Christo...
GECCO
2003
Springer
415views Optimization» more  GECCO 2003»
15 years 5 months ago
Evolutionary Algorithms for Two Problems from the Calculus of Variations
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...
Bryant A. Julstrom
CP
2000
Springer
15 years 4 months 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
SC
2009
ACM
15 years 6 months ago
Age based scheduling for asymmetric multiprocessors
Asymmetric (or Heterogeneous) Multiprocessors are becoming popular in the current era of multi-cores due to their power efficiency and potential performance and energy efficienc...
Nagesh B. Lakshminarayana, Jaekyu Lee, Hyesoon Kim
AIPS
2006
15 years 1 months ago
Tractable Optimal Competitive Scheduling
In this paper we describe the problem of Optimal Competitive Scheduling, which consists of activities that compete for a shared resource. The objective is to choose a subset of ac...
Jeremy Frank, James Crawford, Lina Khatib, Ronen I...