2042 search results - page 230 / 409 » Variable Number of |
140
click to vote
ISSRE
2007
IEEE
15 years 7 months ago
2007
IEEE
Model-checkers are powerful tools that can find individual traces through models to satisfy desired properties. These traces provide solutions to a number of problems. Instead of...
159
Voted
IPL
2008
15 years 5 months ago
2008
In this paper, we prove polynomial running time bounds for an Ant Colony Optimization (ACO) algorithm for the single-destination shortest path problem on directed acyclic graphs. ...
143
click to vote
INFORMS
2000
15 years 5 months ago
2000
Time-indexed formulations for machine scheduling problems have received a great deal of attention; not only do the linear programming relaxations provide strong lower bounds, but ...
309
click to vote
CC
2009
Springer
16 years 6 months ago
2009
Springer
form uses a notational abstractions called -functions. These instructions have no analogous in actual machine instruction sets, and they must be replaced by ordinary instructions ...
171
click to vote
FPGA
2003
ACM
15 years 10 months ago
2003
ACM
In this paper, we present the first exact algorithm to solve the constrained I/O placement problem for FPGAs that support multiple I/O standards. We derive a compact integer line...