1289 search results - page 176 / 258 » Complexity of Counting the Optimal Solutions |
DSD
2008
IEEE
15 years 4 months ago
2008
IEEE
Systems on chip (SoC) have much in common with traditional (networked) distributed systems in that they consist of largely independent components with dedicated communication inte...
121
click to vote
ISPDC
2008
IEEE
15 years 4 months ago
2008
IEEE
This paper presents a new approach for analyzing the performance of grid scheduling algorithms for tasks with dependencies. Finding the optimal procedures for DAG scheduling in Gr...
ICCV
2007
IEEE
15 years 4 months ago
2007
IEEE
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...
CEC
2007
IEEE
14 years 11 months ago
2007
IEEE
Abstract—The high-level synthesis process allows the automatic design and implementation of digital circuits starting from a behavioral description. Evolutionary algorithms are v...
COR
2010
14 years 10 months ago
2010
Companies in the concrete industry are facing the following scheduling problem on a daily basis: concrete produced at several plants has to be delivered at customers' constru...