1972 search results - page 345 / 395 » Evolutionary algorithms and dynamic programming |
145
click to vote
STOC
2010
ACM
15 years 7 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
118
click to vote
COR
2006
15 years 3 months ago
2006
We study the problem of planning the production of new and recovering defective items of the same product manufactured on the same facility. Items of the product are produced in b...
109
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
137
click to vote
DAM
2007
15 years 3 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
163
click to vote
IPPS
2010
IEEE
15 years 28 days ago
2010
IEEE
The advent of general purpose graphics processing units (GPGPU's) brings about a whole new platform for running numerically intensive applications at high speeds. Their multi-...