18306 search results - page 478 / 3662 » Algorithmics in Exponential Time |
222
click to vote
CSC
2009
15 years 8 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
171
Voted
CCE
2008
15 years 7 months ago
2008
This paper addresses the problem of the optimal design of batch plants with imprecise demands and proposes an alternative treatment of the imprecision by using fuzzy concepts. For...
254
Voted
IEEEHPCS
2010
15 years 5 months ago
2010
The performance (in term of error rate) of biometric systems can be improved by combining them. Multiple fusion techniques can be applied from classical logical operations to more...
160
click to vote
ICIP
2000
IEEE
16 years 9 months ago
2000
IEEE
The maximum intensity projection (MIP) is a useful tool to visualize 3D images. The processing time of the MIP depends on the number of voxels of the 3D data. Therefore, it is ver...
199
Voted
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
The general approach to fault tolerance in uniprocessor systems is to maintain enough time redundancy in the schedule so that any task instance can be re-executed in presence of f...