8413 search results - page 430 / 1683 » Ordering Problem Subgoals |
147
click to vote
ICCS
2003
Springer
15 years 12 months ago
2003
Springer
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
164
Voted
DATE
2002
IEEE
15 years 11 months ago
2002
IEEE
The problem of fault grading for multiple path delay faults is studied and a method of obtaining the exact coverage is presented. The faults covered are represented and manipulate...
186
click to vote
AIIA
2009
Springer
15 years 11 months ago
2009
Springer
In this paper a planning framework based on Ant Colony Optimization techniques is presented. Optimal planning is a very hard computational problem which has been coped with differe...
138
click to vote
FCCM
2000
IEEE
15 years 11 months ago
2000
IEEE
For multiple FPGA systems, the limited number of I/O pins causes many problems. To solve these problems, efficient communication scheduling among FPGAs is crucial for obtaining hi...
204
click to vote
ICPADS
1998
IEEE
15 years 11 months ago
1998
IEEE
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...