4536 search results - page 556 / 908 » Contention-Sensitive Data Structures and Algorithms |
179
click to vote
CGF
2004
15 years 6 months ago
2004
In recent years it has been shown that, above a certain complexity, points become the most efficient rendering primitives. Although the programmability of the lastest graphics har...
181
Voted
GECCO
2007
Springer
16 years 28 days ago
2007
Springer
Engineering design increasingly uses computer simulation models coupled with optimization algorithms to find the best design that meets the customer constraints within a time con...
178
click to vote
WEA
2005
Springer
16 years 7 days ago
2005
Springer
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
202
click to vote
ESA
1998
Springer
15 years 11 months ago
1998
Springer
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
194
Voted
SODA
2008
ACM
15 years 8 months ago
2008
ACM
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...