Sciweavers

12950 search results - page 261 / 2590
» On Optimal Timed Strategies
Sort
View
170
Voted
IPL
2006
104views more  IPL 2006»
15 years 6 months ago
Optimal register allocation for SSA-form programs in polynomial time
This paper gives a constructive proof that the register allocation problem for a uniform register set is solvable in polynomial time for SSA-form programs. 2006 Elsevier B.V. All ...
Sebastian Hack, Gerhard Goos
WADS
2005
Springer
111views Algorithms» more  WADS 2005»
16 years 4 days ago
Near-Optimal Pricing in Near-Linear Time
We present efficient approximation algorithms for a number of problems that call for computing the prices that maximize the revenue of the seller on a set of items. Algorithms for ...
Jason D. Hartline, Vladlen Koltun
CGO
2007
IEEE
16 years 1 months ago
Run-Time Support for Optimizations Based on Escape Analysis
The JavaTM programming language does not allow the programmer to influence memory management. An object is usually allocated on the heap and deallocated by the garbage collector ...
Thomas Kotzmann, Hanspeter Mössenböck
MONET
2002
155views more  MONET 2002»
15 years 6 months ago
A Prioritized Real-Time Wireless Call Degradation Framework for Optimal Call Mix Selection
This paper describes a framework for selecting the optimal call mix to be admitted while employing a bandwidth degradation policy in a wireless cellular network. The optimal proper...
Gergely V. Záruba, Imrich Chlamtac, Sajal K...
SPAA
1996
ACM
15 years 10 months ago
Constant Time per Edge is Optimal on Rooted Tree Networks
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
Michael Mitzenmacher