2796 search results - page 183 / 560 » The coolest path problem |
168
click to vote
GD
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We consider the problem of simultaneous embedding of planar graphs. We demonstrate how to simultaneously embed a path and an n-level planar graph and how to use radial em...
193
click to vote
AIPS
2008
15 years 8 months ago
2008
In this paper we face the Job Shop Scheduling Problem with Sequence Dependent Setup Times by means of a genetic algorithm hybridized with local search. We have built on a previous...
172
click to vote
ALIFE
2000
15 years 6 months ago
2000
This article lists fourteen open problems in artificial life, each of which is a grand challenge requiring a major advance on a fundamental issue for its solution. Each problem is ...
182
click to vote
DAGSTUHL
2006
15 years 8 months ago
2006
Supercomputing applications usually involve the repeated parallel application of discretized differential operators. Difficulties arise with higher-order discretizations their com...
186
click to vote
COCOON
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...