This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
In this article we answer the complexity question of two dual criteria scheduling problems which had been open for a long time. Both problems are single machine scheduling problem...
Most applications of evolutionary algorithms (EAs) deal with static optimization problems. However, in recent years, there has been a growing interest in timevarying (dynamic) prob...
Rasmus K. Ursem, Thiemo Krink, Mikkel T. Jensen, Z...
As shown in [7], optimal control problems with either ODE or PDE dynamics can be solved efficiently using a setting of consistent approximations obtained by numerical discretizati...
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
Object-oriented development is expected to provide many benefits, but observations of industrial practice show that there are many problems to overcome. This paper discusses two i...
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...
: Many classification problems involve high dimensional inputs and a large number of classes. Multiclassifier fusion approaches to such difficult problems typically centre around s...
The need for negotiation in multi-agent systems stems from the requirement for agents to solve the problems posed by their interdependence upon one another. Negotiation provides a...
Simon Parsons, Carles Sierra, Nicholas R. Jennings