2636 search results - page 348 / 528 » Linear Programming |
129
Voted
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
100
Voted
ICRA
2003
IEEE
15 years 9 months ago
2003
IEEE
This paper presents an algorithm, called PCG, for planning the foothold positions of spider-like robots in planar tunnels bounded by piecewise linear walls. The paper focuses on 3-...
173
click to vote
ISPAN
2002
IEEE
15 years 8 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
129
Voted
IPPS
2000
IEEE
15 years 8 months ago
2000
IEEE
Abstract. Computer simulations of realistic applications usually require solving a set of non-linear partial di erential equations PDEs over a nite region. The process of obtaini...
145
click to vote
ARCS
2008
Springer
15 years 5 months ago
2008
Springer
: The architecture of the IBM Cell BE processor represents a new approach for designing CPUs. The fast execution of legacy software has to stand back in order to achieve very high ...