10988 search results - page 2154 / 2198 » Algorithmic Folding Complexity |
113
Voted
AAAI
1993
15 years 3 months ago
1993
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...
291
click to vote
GRAPHICSINTERFACE
1996
15 years 3 months ago
1996
We present a comprehensive methodology for realistically animating liquid phenomena. Our approach unifies existing computer graphics techniques for simulating fluids and extends t...
127
click to vote
USENIX
1994
15 years 3 months ago
1994
As distributed computing systems grow in size, complexity and variety of application, the problem of protecting sensitive data from unauthorized disclosure and tampering becomes i...
107
click to vote
IJCAI
1989
15 years 3 months ago
1989
Usually, semantics of inheritance networks is specified indirectly through a translation into one of the standard logical formalisms. Since such translation involves an algorithmi...
128
Voted
WCE
2007
15 years 3 months ago
2007
—Partitioned global address space (PGAS) languages, such as Unified Parallel C (UPC) have the promise of being productive. Due to the shared address space view that they provide,...