Sciweavers

837 search results - page 115 / 168
» Hard combinators
Sort
View
ICFP
2002
ACM
15 years 11 months ago
Tagless staged interpreters for typed languages
Multi-stage programming languages provide a convenient notation for explicitly staging programs. Staging a definitional interpreter for a domain specific language is one way of de...
Emir Pasalic, Walid Taha, Tim Sheard
MOBISYS
2008
ACM
15 years 11 months ago
Efficient channel-aware rate adaptation in dynamic environments
Increasingly, 802.11 devices are being used by mobile users. This results in very dynamic wireless channels that are difficult to use efficiently. Current rate selection algorithm...
Glenn Judd, Xiaohui Wang, Peter Steenkiste
MOBISYS
2007
ACM
15 years 11 months ago
Triage: balancing energy and quality of service in a microserver
The ease of deployment of battery-powered and mobile systems is pushing the network edge far from powered infrastructures. A primary challenge in building untethered systems is of...
Nilanjan Banerjee, Jacob Sorber, Mark D. Corner, S...
MOBIHOC
2007
ACM
15 years 11 months ago
Scalable routing in delay tolerant networks
The non-existence of an end-to-end path poses a challenge in adapting the traditional routing algorithms to delay tolerant networks (DTNs). Previous works include centralized rout...
Cong Liu, Jie Wu
EUROSYS
2010
ACM
15 years 9 months ago
Execution Synthesis: A Technique for Automated Software Debugging
Debugging real systems is hard, requires deep knowledge of the code, and is time-consuming. Bug reports rarely provide sufficient information, thus forcing developers to turn int...
Cristian Zamfir, George Candea