Sciweavers

10051 search results - page 109 / 2011
» A Dynamic Separator Algorithm
Sort
View
MP
2010
145views more  MP 2010»
14 years 11 months ago
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm
The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. ...
Irina Dumitrescu, Stefan Ropke, Jean-Franço...
106
Voted
AAAI
2006
15 years 2 months ago
An Efficient Algorithm for Local Distance Metric Learning
Learning application-specific distance metrics from labeled data is critical for both statistical classification and information retrieval. Most of the earlier work in this area h...
Liu Yang, Rong Jin, Rahul Sukthankar, Yi Liu
76
Voted
ICSE
2003
IEEE-ACM
16 years 23 days ago
Precise Dynamic Slicing Algorithms
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. In this paper we present the d...
Xiangyu Zhang, Rajiv Gupta, Youtao Zhang
115
Voted
ACTAC
2002
102views more  ACTAC 2002»
15 years 17 days ago
Handling Pointers and Unstructured Statements in the Forward Computed Dynamic Slice Algorithm
Different program slicing methods are used for debugging, testing, reverse engineering and maintenance. Slicing algorithms can be classified as a static slicing or dynamic slicing...
Csaba Faragó, Tamás Gergely
EVOW
2009
Springer
14 years 10 months ago
An Immune System Based Genetic Algorithm Using Permutation-Based Dualism for Dynamic Traveling Salesman Problems
In recent years, optimization in dynamic environments has attracted a growing interest from the genetic algorithm community due to the importance and practicability in real world a...
Lili Liu, Dingwei Wang, Shengxiang Yang