Sciweavers

11345 search results - page 17 / 2269
» Foundations of Computer Science
Sort
View
SPAA
2009
ACM
14 years 8 months ago
Buffer management for colored packets with deadlines
We consider buffer management of unit packets with deadlines for a multi-port device with reconfiguration overhead. The goal is to maximize the throughput of the device, i.e., the...
Yossi Azar, Uriel Feige, Iftah Gamzu, Thomas Mosci...
RELMICS
2001
Springer
14 years 3 days ago
Groups in Allegories
Groups are one of the most fundamental notions in mathematics. This paper provides a foundation of group theory in allegories. Almost all results in the paper can be applied to the...
Yasuo Kawahara
COMPUTER
2007
153views more  COMPUTER 2007»
13 years 7 months ago
The Discipline of Embedded Systems Design
ems, using abstractions that actually remove physical constraints from consideration. At the other, embedded systems design goes beyond the traditional expertise of electrical engi...
Thomas A. Henzinger, Joseph Sifakis
ICCS
2001
Springer
14 years 4 days ago
Developing Components and Curricula for a Research-Rich Undergraduate Degree in Computational Physics
Abstract. A four-year undergraduate curriculum leading to a Bachelor’s degree in Computational Physics is described. The courses, texts, and seminars are research- and Web-rich, ...
Rubin H. Landau
COCO
1991
Springer
93views Algorithms» more  COCO 1991»
13 years 11 months ago
Relating Equivalence and Reducibility to Sparse Sets
For various polynomial-time reducibilities r, this paper asks whether being r-reducible to a sparse set is a broader notion than being r-equivalent to a sparse set. Although distin...
Eric Allender, Lane A. Hemachandra, Mitsunori Ogiw...