9 resultados para NP 4457:2007

em Universidade do Minho


Relevância:

30.00% 30.00%

Publicador:

Resumo:

Dissertação de mestrado em Técnicas de Caracterização e Análise Química

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Trabalho desenvolvido em parceria com a empresa Casais.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

[Excerpt] The 11th RoboCup International Symposium was held during July 9–10, 2007 at the Fox Theatre in Atlanta, GA, immediately after the 2007 Soccer, Rescue and Junior Competitions. The RoboCup community has observed an increasing interest from other communities over the past few years, e.g., the robotics community.RoboCupisseenasasignificantapproachtotheevaluationofnewlydeveloped methods to many difficult problems in robotics. Atlanta was also the location of a RoboCup@Space demonstration, which reflected the role of AI and robotics in space exploration. Prior to the symposium, space agencies had expressed an interest in cooperating with RoboCup. A first step in this direction was a successful demonstration at RoboCup 2007, which was accompanied with aninvitedtalkgivenbyaleadingscientistfromtheJapanAerospaceExploration Agency JAXA. [...]

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Dissertação de mestrado em Construção e Reabilitação Sustentáveis

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The artificial fish swarm algorithm has recently been emerged in continuous global optimization. It uses points of a population in space to identify the position of fish in the school. Many real-world optimization problems are described by 0-1 multidimensional knapsack problems that are NP-hard. In the last decades several exact as well as heuristic methods have been proposed for solving these problems. In this paper, a new simpli ed binary version of the artificial fish swarm algorithm is presented, where a point/ fish is represented by a binary string of 0/1 bits. Trial points are created by using crossover and mutation in the different fi sh behavior that are randomly selected by using two user de ned probability values. In order to make the points feasible the presented algorithm uses a random heuristic drop item procedure followed by an add item procedure aiming to increase the profit throughout the adding of more items in the knapsack. A cyclic reinitialization of 50% of the population, and a simple local search that allows the progress of a small percentage of points towards optimality and after that refines the best point in the population greatly improve the quality of the solutions. The presented method is tested on a set of benchmark instances and a comparison with other methods available in literature is shown. The comparison shows that the proposed method can be an alternative method for solving these problems.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Dissertação de mestrado em Direito da União Europeia

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Dissertação de mestrado integrado em Engenharia Civil

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Dissertação de mestrado em Geografia (área de especialização em Planeamento e Gestão do Território)