2474 search results - page 257 / 495 » Solving Problems on Parallel Computers by Cellular Programmi... |
181
click to vote
JSA
2000
15 years 6 months ago
2000
In this article, the problem of finding a tight estimate on the worst-case execution time (WCET) of a real-time program is addressed. The analysis is focused on straight-line code...
200
click to vote
GECCO
2010
Springer
15 years 11 months ago
2010
Springer
The original mechanism by which evolutionary algorithms were to solve problems was to allow for the gradual discovery of sub-solutions to sub-problems, and the automated combinati...
170
click to vote
EOR
2010
15 years 3 months ago
2010
: We describe a method to find low cost shift schedules with a time-varying service level that is always above a specified minimum. Most previous approaches used a two-step procedu...
167
click to vote
VLSID
2003
IEEE
16 years 6 months ago
2003
IEEE
In the previous work, the problem of nding gate delays to eliminate glitches has been solved by linear programs (LP) requiring an exponentially large number ofconstraints. By intr...
193
click to vote
ANNPR
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Decomposition techniques are used to speed up training support vector machines but for linear programming support vector machines (LP-SVMs) direct implementation of decom...