2109 search results - page 195 / 422 » Solving Necklace Constraint Problems |
187
click to vote
ASPDAC
2010
ACM
15 years 4 months ago
2010
ACM
Abstract-- We present a global scheduling framework for synchronous data flow (SDF) streaming applications on MPSoCs, based on optimized computation and contention-free routing. Th...
161
click to vote
ECCV
2002
Springer
16 years 8 months ago
2002
Springer
Abstract. Determining shape from stereo has often been posed as a global minimization problem. Once formulated, the minimization problems are then solved with a variety of algorith...
159
click to vote
ICCAD
2003
IEEE
16 years 3 months ago
2003
IEEE
– Many embedded system designs usually impose (hard) read-time constraints on tasks. Thus, computing a tight upper bound of the worst case execution time (WCET) of a software is ...
182
click to vote
STAIRS
2008
15 years 8 months ago
2008
We study a problem of path planning for a group of robots in this paper. The problem is stated as a finding of spatial-temporal paths through which the robots can go from their ini...
197
click to vote
AI
2011
Springer
15 years 1 months ago
2011
Springer
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...