1552 search results - page 128 / 311 » On the Complexity of Constant Propagation |
146
click to vote
COCO
2007
Springer
16 years 18 days ago
2007
Springer
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
141
click to vote
CSL
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. By introducing a parallel extension rule that is aware of independence of the introduced extension variables, a calculus for quantified propositional logic is obtained w...
147
click to vote
IROS
2006
IEEE
16 years 14 days ago
2006
IEEE
— Today, lightweight SLAM algorithms are needed in many embedded robotic systems. In this paper the Orthogonal SLAM (OrthoSLAM ) algorithm is presented and empirically validated....
148
click to vote
SRDS
2003
IEEE
15 years 11 months ago
2003
IEEE
The perfectly synchronized round model provides the abstraction of crash-stop failures with atomic message delivery. This abstraction makes distributed programming very easy. We p...
140
click to vote
RT
1998
Springer
15 years 10 months ago
1998
Springer
We describe an efficient approach to rendering a perspectively correct image on a potentially irregular display surface that may be illuminated with one or more distinct devices. T...