Sciweavers

26354 search results - page 145 / 5271
» How we refactor, and how we know it
Sort
View
SODA
2008
ACM
127views Algorithms» more  SODA 2008»
13 years 11 months ago
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
A travel booking office has timetables giving arrival and departure times for all scheduled trains, including their origins and destinations. A customer presents a starting city a...
Virginia Vassilevska
APVIS
2006
13 years 11 months ago
How people read sociograms: a questionnaire study
Visualizing social network data into sociograms plays an important role in communicating information about network characteristics. Previous studies have shown that human percepti...
Weidong Huang, Seok-Hee Hong, Peter Eades
USENIX
2004
13 years 11 months ago
How Xlib Is Implemented (and What We're Doing About It)
The X Window System is the de facto standard graphical environment for Linux and Unix hosts, and is usable on nearly any class of computer one could find today. Its success is par...
Jamey Sharp
WOA
2001
13 years 11 months ago
How to Support Adaptive Mobile Applications
The Mobile Agent (MA) paradigm seems to be a promising solution for the design and development of distributed value-added services. However, mobility has added complexity to the d...
Antonio Corradi, Rebecca Montanari, Gianluca Tonti...
AHSWN
2010
130views more  AHSWN 2010»
13 years 10 months ago
How Good is Opportunistic Routing? - A Reality Check under Rayleigh Fading Channels
Considerations of realistic channel dynamics motivate the design of a new breed of opportunistic schemes, such as opportunistic transmission, scheduling and routing. Compared to t...
Rong Zheng, Chengzhi Li