Sciweavers

6568 search results - page 1255 / 1314
» Reducing the Complexity of Reductions
Sort
View
EGH
2004
Springer
15 years 11 months ago
A programmable vertex shader with fixed-point SIMD datapath for low power wireless applications
The real time 3D graphics becomes one of the attractive applications for 3G wireless terminals although their battery lifetime and memory bandwidth limit the system resources for ...
Ju-Ho Sohn, Ramchan Woo, Hoi-Jun Yoo
EMSOFT
2004
Springer
15 years 11 months ago
Approximation of the worst-case execution time using structural analysis
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
Matteo Corti, Thomas R. Gross
QOFIS
2004
Springer
15 years 11 months ago
BarterRoam: A Novel Mobile and Wireless Roaming Settlement Model
This paper describes BarterRoam: a new novel mobile and wireless roaming settlement model and clearance methodology, based on the concept of sharing and bartering excess capacities...
Eng Keong Lua, Alex Lin, Jon Crowcroft, Valerie Ta...
TACAS
2004
Springer
122views Algorithms» more  TACAS 2004»
15 years 11 months ago
A Scalable Incomplete Test for the Boundedness of UML RT Models
Abstract. We describe a scalable incomplete boundedness test for the communication buffers in UML RT models. UML RT is a variant of the UML modeling language, tailored to describin...
Stefan Leue, Richard Mayr, Wei Wei
W2GIS
2004
Springer
15 years 11 months ago
Expansion-Based Algorithms for Finding Single Pair Shortest Path on Surface
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...
Ke Deng, Xiaofang Zhou
« Prev « First page 1255 / 1314 Last » Next »