613 search results - page 12 / 123 » Finding and Fixing Faults |
MOC
2002
14 years 9 months ago
2002
Some useful information is known about the fundamental domain for certain Hilbert modular groups. The six nonequivalent points with nontrivial isotropy in the fundamental domains u...
75
Voted
ICNP
1999
IEEE
15 years 1 months ago
1999
IEEE
Routing protocol faults cause problems ranging from an inability to communicate to excessive routing overhead. This paper proposes a system for detecting a wide range of routing p...
CCCG
2006
14 years 11 months ago
2006
Soss proved that it is NP-hard to find the maximum flat span of a fixed-angle polygonal chain: the largest distance achievable between the endpoints in a planar embedding. These f...
TCAD
2010
14 years 4 months ago
2010
In this paper, we present DeFer--a fast, high-quality, scalable, and nonstochastic fixed-outline floorplanning algorithm. DeFer generates a nonslicing floorplan by compacting a sli...
ICSE
2009
IEEE-ACM
15 years 10 months ago
2009
IEEE-ACM
Automatic repair of programs has been a longstanding goal in software engineering, yet debugging remains a largely manual process. We introduce a fully automated method for locati...