121 search results - page 13 / 25 » Optimizing polynomials for floating-point implementation |
INFOCOM
2003
IEEE
15 years 3 months ago
2003
IEEE
Abstract— Efficient bandwidth allocation strategy with simultaneous fulfillment of QoS requirement of a user in a mobile cellular network is still a critical and an important p...
ASPDAC
2007
ACM
15 years 1 months ago
2007
ACM
Abstract: This paper presents an approach to area optimization of arithmetic datapaths that perform polynomial computations over bit-vectors with finite widths. Examples of such de...
AIPS
2006
14 years 11 months ago
2006
In this paper we describe the problem of Optimal Competitive Scheduling, which consists of activities that compete for a shared resource. The objective is to choose a subset of ac...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Abstract- We investigate cooperative wireless relay networks in which the nodes can help each other in data transmission. We study different coding strategies in the single-source ...
AIPS
2010
15 years 2 days ago
2010
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...