22 search results - page 2 / 5 » Engineering Time-Dependent Many-to-Many Shortest Paths Compu... |
IEEEPACT
2006
IEEE
14 years 1 months ago
2006
IEEE
A recent trend in computing are domain-specific program generators, designed to alleviate the effort of porting and reoptimizing libraries for fast-changing and increasingly com...
GLOBECOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— In this paper, we evaluate a solution based on the preemption mechanism so as to improve performances of distributed Multi-Protocol Label Switching-Traffic Engineering (MPLS-T...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—Path computation elements (PCE’s) are used to compute end-to-end paths across multiple areas. Multiple PCE’s may be dedicated to each area to provide sufficient path...
PUK
2003
13 years 8 months ago
2003
This paper exploits the spatial representation of state space problem graphs to preprocess and enhance heuristic search engines. It combines classical AI exploration with computati...
FSTTCS
2004
Springer
14 years 24 days ago
2004
Springer
When studying a 3D polyhedron, it is often easier to cut it open and
atten in on the plane. There are several ways to perform this unfolding. Standard unfoldings which have been u...