388 search results - page 53 / 78 » A Mixed Closure-CSP Method to Solve Scheduling Problems |
COR
2008
14 years 12 months ago
2008
Consider the following heuristic for planar Euclidean instances of the Traveling Salesman Problem (TSP): select a subset of the edges which induces a planar graph, and solve eithe...
127
click to vote
WIOPT
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract—We consider the problem of jointly optimizing random access and subgraph selection in coded wireless packet networks. As opposed to the corresponding scheduling approach...
190
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
In bibliographies like DBLP and Citeseer, there are three kinds of entity-name problems that need to be solved. First, multiple entities share one name, which is called the name sh...
116
click to vote
TROB
2010
14 years 10 months ago
2010
—Robotic systems need to be able to plan control actions that are robust to the inherent uncertainty in the real world. This uncertainty arises due to uncertain state estimation,...
GECCO
2010
Springer
15 years 3 months ago
2010
Springer
This paper reports about the application of a new variant of multiobjective Mixed-Integer Evolution Strategy to a warehouse design optimization problem. The algorithm is able to d...