9810 search results - page 64 / 1962 » Problems, Descriptions and Objects |
ENDM
2010
13 years 7 months ago
2010
This paper deals with an NP-hard bi-objective one-machine problem with ready times involving maximum lateness and unit family setup cost objectives. Considering separately both ob...
FUIN
2007
13 years 10 months ago
2007
It is shown that the boundedness problem for a certain class of basic object nets and a corresponding class of multiset rewriting systems is decidable. To achieve this result Dicks...
CEC
2009
IEEE
14 years 2 months ago
2009
IEEE
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...
ECOOP
2005
Springer
14 years 3 months ago
2005
Springer
The three problems of the title — the first two widely discussed in the literature, the third less well known but just as important for further development of object technology ...
EMO
2001
Springer
14 years 2 months ago
2001
Springer
One common characterization of how simple hill-climbing optimization methods can fail is that they become trapped in local optima - a state where no small modi cation of the curren...