2474 search results - page 28 / 495 » Solving Problems on Parallel Computers by Cellular Programmi... |
COR
2008
15 years 2 months ago
2008
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
212
click to vote
NC
2011
14 years 4 months ago
2011
In this paper, graph multiset transformation is introduced and studied as a novel type of parallel graph transformation. The basic idea is that graph transformation rules may be ap...
117
click to vote
ESOP
2009
Springer
15 years 5 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
114
click to vote
ESA
2010
Springer
15 years 2 months ago
2010
Springer
We report on the solution of a real-time scheduling problem that arises in the design of software-based operation control of aircraft. A set of tasks has to be distributed on a min...
143
click to vote
PDP
2002
IEEE
15 years 6 months ago
2002
IEEE
A parallel simulated annealing algorithm to solve the vehicle routing problem with time windows is presented. The objective is to find the best possible solutions to some wellkno...