47 search results - page 1 / 10 » Valiant's model and the cost of computing integers |
CC
2005
Springer
13 years 4 months ago
2005
Springer
Let (n) be the minimum number of arithmetic operations required to build the integer n N from the constants 1 and 2. A sequence xn is said to be "easy to compute" if the...
FOSSACS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We extend discrete-timed Petri nets with a cost model that assigns token storage costs to places and firing costs to transitions, and study the minimal cost reachability...
EOR
2007
13 years 4 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...
GECON
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. The advent of Grid computing gives enterprises an ever increasing choice of computing options, yet research has so far hardly addressed the problem of mixing the differe...
ICMCS
2006
IEEE
13 years 11 months ago
2006
IEEE
In this paper, an efficient cost function for mode decision in H.264/AVC is proposed. The proposed cost function is based on integer transform coefficients, where the rate and the...