Sciweavers

13137 search results - page 2279 / 2628
» A Science of Software Design
Sort
View
JACM
2000
86views more  JACM 2000»
15 years 6 months ago
Periodification scheme: constructing sorting networks with constant period
We consider comparator networks M that are used repeatedly: while the output produced by M is not sorted, it is fed again into M. Sorting algorithms working in this way are called ...
Miroslaw Kutylowski, Krzysztof Lorys, Brigitte Oes...
CN
1998
64views more  CN 1998»
15 years 6 months ago
Decentralized Network Connection Preemption Algorithms
Connection preemption provides available and reliable services to high-priority connections when a network is heavily loaded and connection request arrival patterns are unknown, o...
Mohammad Peyravian, Ajay D. Kshemkalyani
COMCOM
1998
102views more  COMCOM 1998»
15 years 6 months ago
Preferred link based delay-constrained least-cost routing in wide area networks
Multimedia applications involving digital audio and/or digital video transmissions require strict QoS constraints (end-to-end delay bound, bandwidth availability, packet loss rate...
R. Sriram, Govindarasu Manimaran, C. Siva Ram Murt...
IJRR
2002
105views more  IJRR 2002»
15 years 6 months ago
Computing Wrench Cones for Planar Rigid Body Contact Tasks
The contribution of this paper is the expansion of the range of possibilities in the analysis, planning, and control of contact tasks. The successful execution of any contact task...
Devin J. Balkcom, Jeffrey C. Trinkle
JCB
1998
129views more  JCB 1998»
15 years 6 months ago
A Sticker-Based Model for DNA Computation
We introduce a new model of molecular computation that we call the sticker model. Like many previous proposals it makes use of DNA strands as the physical substrate in which infor...
Sam T. Roweis, Erik Winfree, Richard Burgoyne, Nic...
« Prev « First page 2279 / 2628 Last » Next »