Sciweavers

13987 search results - page 358 / 2798
» The Two Guards Problem
Sort
View
191
Voted
IJIT
2004
15 years 8 months ago
Memetic Algorithm Based Path Planning for a Mobile Robot
In this paper, the problem of finding the optimal collision free path for a mobile robot, the path planning problem, is solved using an advanced evolutionary algorithm called memet...
Neda Shahidi, Hadi Esmaeilzadeh, Marziye Abdollahi...
ATMOS
2009
105views Optimization» more  ATMOS 2009»
15 years 8 months ago
On Assessing Robustness in Transportation Planning
Abstract. We consider a fundamental problem, called QoS-aware Multicommodity Flow, for assessing robustness in transportation planning. It constitutes a natural generalization of t...
Apostolos Bessas, Christos D. Zaroliagis
ECCV
2010
Springer
15 years 8 months ago
Fast Optimization for Mixture Prior Models
Abstract. We consider the minimization of a smooth convex function regularized by the mixture of prior models. This problem is generally difficult to solve even each simpler regula...
Junzhou Huang, Shaoting Zhang, Dimitris N. Metaxas
AMC
2006
76views more  AMC 2006»
15 years 6 months ago
A soft computing method for multi-criteria decision making with dependence and feedback
In this paper, the decision making problems with the dependence and the feedback effects are considered. Although the analytic network/hierarchy process (ANP/AHP) has been propose...
Rachung Yu, Gwo-Hshiung Tzeng
189
Voted
ECCC
2006
112views more  ECCC 2006»
15 years 6 months ago
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
We present two new methods for finding a lowest common ancestor (LCA) for each pair of vertices of a directed acyclic graph (dag) on n vertices and m edges. The first method is su...
Artur Czumaj, Miroslaw Kowaluk, Andrzej Lingas