Sciweavers

1816 search results - page 113 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
ASPDAC
2004
ACM
141views Hardware» more  ASPDAC 2004»
15 years 11 months ago
An approach for reducing dynamic power consumption in synchronous sequential digital designs
— The problem of minimizing dynamic power consumption by scaling down the supply voltage of computational elements off critical paths is widely addressed in the literature for th...
Noureddine Chabini, Wayne Wolf
ATAL
2009
Springer
16 years 20 days ago
Decentralised dynamic task allocation: a practical game: theoretic approach
This paper reports on a novel decentralised technique for planning agent schedules in dynamic task allocation problems. Specifically, we use a Markov game formulation of these pr...
Archie C. Chapman, Rosa Anna Micillo, Ramachandra ...
CEC
2009
IEEE
15 years 10 months ago
Performance of infeasibility driven evolutionary algorithm (IDEA) on constrained dynamic single objective optimization problems
Abstract—A number of population based optimization algorithms have been proposed in recent years to solve unconstrained and constrained single and multi-objective optimization pr...
Hemant K. Singh, Amitay Isaacs, Trung Thanh Nguyen...
JOTA
2010
127views more  JOTA 2010»
15 years 26 days ago
Optimization Over the Efficient Set of Multi-objective Convex Optimal Control Problems
We consider multi-objective convex optimal control problems. First we state a relationship between the (weakly or properly) efficient set of the multi-objective problem and the sol...
Henri Bonnel, C. Yalçin Kaya
164
Voted
HPCN
1995
Springer
15 years 9 months ago
Discrete optimisation and real-world problems
In the global economy, proper organisation and planning of production and storage locations, transportation and scheduling are vital to retain the competitive edge of companies. Th...
Josef Kallrath, Anna Schreieck