14518 search results - page 223 / 2904 » Two Problems for Sophistication |
137
Voted
PEPM
1995
ACM
15 years 4 months ago
1995
ACM
This paper concerns a method for approximating the possible “shapes” that heap-allocated structures in a program can take on. We present a new approach to finding solutions t...
147
Voted
COCOA
2008
Springer
15 years 2 months ago
2008
Springer
We introduce a new combinatorial optimization problem, which is a generalization of the Traveling Salesman Problem (TSP) and which we call Traveling Salesman Problem of Second Orde...
111
Voted
AMC
2006
15 years 25 days ago
2006
This paper considers an extension of a vehicle routing problem with backhauls (VRPB). In this problem, a set of costumers are divided in two subsets consisting of linehaul and bac...
86
Voted
CORR
2006
Springer
15 years 24 days ago
2006
Springer
We consider a memory allocation problem. This problem can be modeled as a version of bin packing where items may be split, but each bin may contain at most two (parts of) items. T...
90
Voted
DAM
2006
15 years 23 days ago
2006
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neigh...