4839 search results - page 662 / 968 » A survey of computational complexity results in systems and ... |
179
click to vote
SIGGRAPH
1999
ACM
15 years 11 months ago
1999
ACM
We present a preprocessing algorithm and run-time system for rendering 3D geometric models at a guaranteed frame rate. Our approach trades off space for frame rate by using images...
209
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...
185
click to vote
CMSB
2006
Springer
15 years 10 months ago
2006
Springer
Having in mind the large-scale analysis of gene regulatory networks, we review a graph decimation algorithm, called "leaf-removal", which can be used to evaluate the feed...
185
click to vote
ERSHOV
2006
Springer
15 years 10 months ago
2006
Springer
The article presents an approach to development of software standards usage infrastructure. The approach is based on formalization of standards and automated conformance test deriv...
161
click to vote
AAAI
2007
15 years 9 months ago
2007
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...