613 search results - page 53 / 123 » The Memory Fragmentation Problem: Solved |
100
click to vote
CDC
2009
IEEE
15 years 7 months ago
2009
IEEE
— Since Witsenhausen put forward his remarkable counterexample in 1968, there have been many attempts to develop efficient methods for solving this non-convex functional optimiz...
117
Voted
SIROCCO
2001
15 years 4 months ago
2001
The condition-based approach for consensus solvability (that we have introduced in a previous paper, ACM STOC'01) consists in identifying sets of input vectors for which it i...
123
Voted
AIPS
2009
15 years 3 months ago
2009
We propose an online algorithm for planning under uncertainty in multi-agent settings modeled as DEC-POMDPs. The algorithm helps overcome the high computational complexity of solv...
98
Voted
ATVA
2005
Springer
15 years 8 months ago
2005
Springer
Partitioned BDD-based algorithms have been proposed in the literature to solve the memory explosion problem in BDD-based verification. A naive parallelization of such algorithms ...
109
click to vote
ICPP
1989
IEEE
15 years 6 months ago
1989
IEEE
We examine computing alternative solutions to a problem in parallel to improve response time. Problems with exploring multiple alternatives in parallel include (1) side-effects an...