Sciweavers

9842 search results - page 156 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
EOR
2008
119views more  EOR 2008»
13 years 10 months ago
A General Vehicle Routing Problem
In this paper we study a rich vehicle routing problem incorporating various complexities found in real-life applications. The General Vehicle Routing Problem (GVRP) is a combined ...
Asvin Goel, Volker Gruhn
JSW
2008
99views more  JSW 2008»
13 years 10 months ago
Using Data Mining in MURA Graphic Problems
The MURA phenomenon will result lots of problems in Photomask and TFT-LCD industries as well. In this paper, we designed and developed a MURA related association rules which suitab...
Wen-Hsing Kao, Jason C. Hung, Victoria Hsu
JALC
2002
97views more  JALC 2002»
13 years 10 months ago
Semiring Frameworks and Algorithms for Shortest-Distance Problems
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
Mehryar Mohri
IEEECIT
2010
IEEE
13 years 8 months ago
Non-recursive Algorithm of Tower of Hanoi Problem
—As we all know, Hanoi Problem is a classical case of recursive algorithm in programming. In this paper, we study the problem in another way by numbering the peg from bottom to t...
Fuwan Ren, Qifan Yang, Jiexin Zheng, Hui Yan
JSC
2010
107views more  JSC 2010»
13 years 8 months ago
Solving the conjugacy problem in Garside groups by cyclic sliding
1 We present a solution to the conjugacy decision problem and the conjugacy search problem2 in Garside groups, which is theoretically simpler than the usual one, with no loss of eï...
Volker Gebhardt, Juan González-Meneses