9325 search results - page 420 / 1865 » The decentralized implementability problem |
133
click to vote
SODA
2000
ACM
15 years 6 months ago
2000
ACM
We discuss the problem of optimally "finishing" a partially sequenced, reconstructed DNA segment. At first sight, this appears to be computationally hard. We construct a...
135
click to vote
AAAI
1993
15 years 6 months ago
1993
One of the hardest problems in reasoning about a physical system is finding an approximate model that is mathematically tractable and yet captures the essence of the problem. Appr...
130
Voted
CCCG
1996
15 years 6 months ago
1996
We present a heuristic approach to the geometric motion planning problem with the aim to quickly solve intuitively simple problems. It is based on a divide-and-conquer path search...
100
click to vote
IDL
1994
15 years 6 months ago
1994
Large softwaresystemsrequiredecompositionalmechanismsinorder tomake themtractable. Traditionally, MILs and IDLs have played this role by providing notations based on definition/us...
126
click to vote
PPSC
1993
15 years 6 months ago
1993
We present a new approach to preconditioning for very large, sparse, non-symmetric, linear systems. We explicitly compute an approximate inverse to our original matrix that can be...