3096 search results - page 478 / 620 » The Generalized FITC Approximation |
133
click to vote
ICCSA
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Though some studies involving general micro-mobility exist, micromobility research concerning a mobile node (MN) moving between Mobile Anchor Points (MAP) is lacking. In ...
161
click to vote
MFCS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
151
click to vote
TLCA
2005
Springer
15 years 10 months ago
2005
Springer
This paper studies continuity of the normal form and the context operators as functions in the infinitary lambda calculus. We consider the Scott topology on the cpo of the finite...
132
Voted
UC
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
138
click to vote
ACMMSP
2004
ACM
15 years 10 months ago
2004
ACM
Irregular applications frequently exhibit poor performance on contemporary computer architectures, in large part because of their inefficient use of the memory hierarchy. Runtime ...