15485 search results - page 556 / 3097 » Computing Optimal Subsets |
271
click to vote
PLDI
1993
ACM
15 years 11 months ago
1993
ACM
Data locality is critical to achievinghigh performance on large-scale parallel machines. Non-local data accesses result in communication that can greatly impact performance. Thus ...
200
click to vote
GD
2000
Springer
15 years 10 months ago
2000
Springer
An orthogonal drawing of a graph is an embedding of the graph in the rectangular grid, with vertices represented by axis-aligned boxes, and edges represented by paths in the grid w...
216
click to vote
PODC
1998
ACM
15 years 10 months ago
1998
ACM
A contract is a non-repudiable agreement on a given contract text, i.e., a contract can be used to prove agreement between its signatories to any verifier. A contract signing sche...
179
click to vote
ECCV
2010
Springer
15 years 9 months ago
2010
Springer
Partial differential equations (PDEs) have been successfully applied to many computer vision and image processing problems. However, designing PDEs requires high mathematical skill...
192
click to vote
CEC
2007
IEEE
15 years 8 months ago
2007
IEEE
— Computational complexity is a major challenge in evolutionary algorithms due to their need for repeated fitness function evaluations. Here, we aim to reduce number of fitness f...