Sciweavers

14518 search results - page 275 / 2904
» Two Problems for Sophistication
Sort
View
NETWORKS
2008
15 years 6 months ago
New dynamic programming algorithms for the resource constrained elementary shortest path problem
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
Giovanni Righini, Matteo Salani
IJCGA
2010
155views more  IJCGA 2010»
15 years 5 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
JCO
2010
123views more  JCO 2010»
15 years 5 months ago
Capacity inverse minimum cost flow problem
Given a directed graph G = (N, A) with arc capacities uij and a minimum cost flow problem defined on G, the capacity inverse minimum cost flow problem is to find a new capacit...
Çigdem Güler, Horst W. Hamacher
PODC
2009
ACM
16 years 7 months ago
Distributed and parallel algorithms for weighted vertex cover and other covering problems
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
Christos Koufogiannakis, Neal E. Young
CHI
2003
ACM
16 years 7 months ago
Repairing usability problems identified by the cognitive walkthrough for the web
Methods for identifying usability problems in web page designs should ideally also provide practical methods for repairing the problems found. Blackmon et al. [2] proved the usefu...
Marilyn Hughes Blackmon, Muneo Kitajima, Peter G. ...