Sciweavers

1392 search results - page 68 / 279
» A Calculus for Dynamic Linking
Sort
View
INFOCOM
2000
IEEE
15 years 8 months ago
Effort-limited Fair (ELF) Scheduling for Wireless Networks
— While packet scheduling for wired links is a maturing area, scheduling of wireless links is less mature. A fundamental difference between wired and wireless links is that wirel...
David A. Eckhardt, Peter Steenkiste
144
Voted
VTC
2006
IEEE
154views Communications» more  VTC 2006»
15 years 10 months ago
OS-multicast: On-demand Situation-aware Multicasting in Disruption Tolerant Networks
—Disruption Tolerant Networks (DTNs) are emerging solutions to networks that experience frequent network partitions and large end-to-end delays. In this paper, we study how to pr...
Qing Ye, Liang Cheng, Mooi Choo Chuah, Brian D. Da...
HT
2000
ACM
15 years 8 months ago
Ontology-supported and ontology-driven conceptual navigation on the World Wide Web
This paper presents the principles of ontology-supported and ontology-driven conceptual navigation. Conceptual navigation realizes the independence between resources and links to ...
Michel Crampes, Sylvie Ranwez
119
Voted
PLDI
1998
ACM
15 years 8 months ago
Units: Cool Modules for HOT Languages
A module system ought to enable assembly-line programming using separate compilation and an expressive linking language. Separate compilation allows programmers to develop parts o...
Matthew Flatt, Matthias Felleisen
231
Voted
POPL
2006
ACM
16 years 4 months ago
Hybrid type checking
Traditional static type systems are very effective for verifying basic interface specifications, but are somewhat limited in the kinds specificationsthey support. Dynamically-chec...
Cormac Flanagan