837 search results - page 27 / 168 » Hard combinators |
ISHPC
1997
Springer
15 years 2 months ago
1997
Springer
Abstract. Writing e cient iterative solvers for irregular, sparse matrices in HPF is hard. The locality in the computations is unclear, and for e ciency we use storage schemes that...
87
Voted
AAAI
2006
14 years 11 months ago
2006
Even under polynomial restrictions on plan length, conformant planning remains a very hard computational problem as plan verification itself can take exponential time. This heavy ...
ICVGIP
2004
14 years 11 months ago
2004
Most fingerprint matching systems are based on matching minutia points between two fingerprint images. Each minutia is represented by a fixed number of attributes such as the loca...
WCE
2007
14 years 11 months ago
2007
- The purpose of this research paper is to study the tool wear and surface roughness of AISI 8620 material using coated ceramic tool by turning process. Ceramic cutting tools have ...
86
Voted
COMCOM
2000
14 years 10 months ago
2000
Distributed multimedia applications will be an important part of tomorrow's application mix and require appropriate operating system (OS) support. Neither hard real-time solu...