Sciweavers

45 search results - page 9 / 9
» Algorithmic skeletons meeting grids
Sort
View
CORR
2006
Springer
94views Education» more  CORR 2006»
13 years 7 months ago
Epsilon-Unfolding Orthogonal Polyhedra
Abstract. An unfolding of a polyhedron is produced by cutting the surface and flattening to a single, connected, planar piece without overlap (except possibly at boundary points). ...
Mirela Damian, Robin Y. Flatland, Joseph O'Rourke
SWAT
1998
Springer
108views Algorithms» more  SWAT 1998»
13 years 11 months ago
Formal Language Constrained Path Problems
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
Christopher L. Barrett, Riko Jacob, Madhav V. Mara...
SOCO
2010
Springer
13 years 2 months ago
Using evolution strategies to solve DEC-POMDP problems
Decentralized partially observable Markov decision process (DEC-POMDP) is an approach to model multi-robot decision making problems under uncertainty. Since it is NEXP-complete the...
Baris Eker, H. Levent Akin
ICCD
2007
IEEE
322views Hardware» more  ICCD 2007»
14 years 4 months ago
Voltage drop reduction for on-chip power delivery considering leakage current variations
In this paper, we propose a novel on-chip voltage drop reduction technique for on-chip power delivery networks of VLSI systems in the presence of variational leakage current sourc...
Jeffrey Fan, Ning Mi, Sheldon X.-D. Tan
CORR
2007
Springer
132views Education» more  CORR 2007»
13 years 7 months ago
On Compact Routing for the Internet
The Internet’s routing system is facing stresses due to its poor fundamental scaling properties. Compact routing is a research field that studies fundamental limits of routing ...
Dmitri V. Krioukov, Kimberly C. Claffy, Kevin R. F...