10608 search results - page 240 / 2122 » Complexity of O'Hara's Algorithm |
105
Voted
WSCG
2001
15 years 1 months ago
2001
In this article we present an algorithm to determine the intersection between rays and triangles based on the idea of the study of signs with respect to triangles. One of the adva...
170
click to vote
CODCRY
2011
Springer
14 years 4 months ago
2011
Springer
We present the state of the art solvers of the Shortest and Closest Lattice Vector Problems in the Euclidean norm. We recall the three main families of algorithms for these problem...
ISPD
2000
ACM
15 years 4 months ago
2000
ACM
Recently, a deterministic algorithm based on the O-tree representation has been proposed. This method generates excellent layout results on MCNC test cases with O(n3 ) complexity,...
117
Voted
CADE
1999
Springer
15 years 4 months ago
1999
Springer
We present a PSpace algorithm that decides satisfiability of the graded modal logic Gr(KR)—a natural extension of propositional modal logic KR by counting expressions—which pl...
ISCAS
2005
IEEE
15 years 6 months ago
2005
IEEE
—Adaptive systems have been broadly used in a wide range of applications and can be categorized into linear or nonlinear adaptive systems. Unfortunately, hardware complexity for ...