110 search results - page 13 / 22 » A Faster Algorithm for Quasi-convex Integer Polynomial Optim... |
CHES
2000
Springer
15 years 2 months ago
2000
Springer
This work proposes a processor architecture for elliptic curves cryptosystems over fields GF(2m ). This is a scalable architecture in terms of area and speed that exploits the abil...
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
Abstract— We study the problem of maximizing the aggregated revenue in sensor networks with deadline constraints. Our model is that of a sensor network that is arranged in the fo...
STOC
2010
ACM
15 years 2 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
EOR
2007
14 years 9 months ago
2007
We consider a supply chain design problem where the decision maker needs to decide the number and locations of the distribution centers (DCs). Customers face random demand, and ea...