Sciweavers

Share
IJCGA
2010
155views more  IJCGA 2010»
8 years 10 months ago
Competitive Complexity of Mobile Robot on-Line Motion Planning Problems
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 ...
Yoav Gabriely, Elon Rimon
ORL
2007
86views more  ORL 2007»
8 years 11 months ago
Complexity of two dual criteria scheduling problems
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...
Yumei Huo, Joseph Y.-T. Leung, Hairong Zhao
TEC
2002
108views more  TEC 2002»
8 years 11 months ago
Analysis and modeling of control tasks in dynamic systems
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...
SIAMCO
2002
121views more  SIAMCO 2002»
8 years 11 months ago
Consistent Approximations and Approximate Functions and Gradients in Optimal Control
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...
Olivier Pironneau, Elijah Polak
TCS
1998
8 years 11 months ago
A Uniform Approach to Semi-Dynamic Problems on Digraphs
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...
Serafino Cicerone, Daniele Frigioni, Umberto Nanni...
SOFTWARE
1998
8 years 11 months ago
Real-Life Object-Oriented Systems
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...
Søren Lauesen
SIAMDM
1998
89views more  SIAMDM 1998»
8 years 11 months ago
String Noninclusion Optimization Problems
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...
Anatoly R. Rubinov, Vadim G. Timkovsky
PAA
2002
8 years 11 months ago
Hierarchical Fusion of Multiple Classifiers for Hyperspectral Data Analysis
: Many classification problems involve high dimensional inputs and a large number of classes. Multiclassifier fusion approaches to such difficult problems typically centre around s...
Shailesh Kumar, Joydeep Ghosh, Melba M. Crawford
LOGCOM
1998
132views more  LOGCOM 1998»
8 years 11 months ago
Agents That Reason and Negotiate by Arguing
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
books