4542 search results - page 736 / 909 » Design patterns for data structures |
173
click to vote
ESOP
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. Dynamicprogramming is an importantalgorithm design technique. It is used for solving problems whose solutions involve recursively solving subproblems that share subsubpro...
164
click to vote
BPM
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Car development is based on long running, concurrently executed and highly dependent processes. The coordination and synchronization of these processes has become a compl...
173
click to vote
AAAI
2000
15 years 7 months ago
2000
Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary. Determining the winners is NP-complete...
155
click to vote
IEEEPACT
2006
IEEE
16 years 14 days ago
2006
IEEE
Modern out-of-order processors with non-blocking caches exploit Memory-Level Parallelism (MLP) by overlapping cache misses in a wide instruction window. The exploitation of MLP, h...
181
click to vote
GEOINFORMATICA
2008
15 years 6 months ago
2008
Topological relationships like overlap, inside, meet, and disjoint uniquely characterize the relative position between objects in space. For a long time, they have been a focus of...