807 search results - page 85 / 162 » Space Efficient Algorithms for Ordered Tree Comparison |
121
click to vote
ECAI
1998
Springer
15 years 8 months ago
1998
Springer
Abstract: Lazy computation is not new in model-based diagnosis of active systems (and of discreteevent systems in general). Up to a decade ago, diagnosis methods for discrete-event...
132
click to vote
IMR
2004
Springer
15 years 9 months ago
2004
Springer
Spacetime Discontinuous Galerkin (DG) methods are used to solve hyperbolic PDEs describing wavelike physical phenomena. When the PDEs are nonlinear, the speed of propagation of th...
137
click to vote
DAC
2008
ACM
16 years 4 months ago
2008
ACM
In this paper, we present DeFer -- a fast, high-quality and nonstochastic fixed-outline floorplanning algorithm. DeFer generates a non-slicing floorplan by compacting a slicing fl...
115
click to vote
DCC
1996
IEEE
15 years 8 months ago
1996
IEEE
Abstract--Minimum redundancy coding (also known as Huffman coding) is one of the enduring techniques of data compression. Many efforts have been made to improve the efficiency of m...
132
Voted
SIROCCO
2008
15 years 5 months ago
2008
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...