Sciweavers

1275 search results - page 102 / 255
» time 1998
Sort
View
SIAMCOMP
1998
168views more  SIAMCOMP 1998»
13 years 9 months ago
Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
This paper first presents a unified approach to design efficient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected,...
Maw-Shang Chang
SIAMCOMP
1998
141views more  SIAMCOMP 1998»
13 years 9 months ago
Randomized Data Structures for the Dynamic Closest-Pair Problem
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
Mordecai J. Golin, Rajeev Raman, Christian Schwarz...
SIAMDM
1998
55views more  SIAMDM 1998»
13 years 9 months ago
Multiple Capacity Vehicle Routing on Paths
Consider the problem of transporting a set of objects between the vertices of a simple graph by a vehicle that traverses the edges of the graph. The problem of finding a shortest...
D. J. Guan, Xuding Zhu
SIGCSE
1998
ACM
154views Education» more  SIGCSE 1998»
13 years 9 months ago
Napier's chessboard calculator
This paper describes our use of a 1970's era PDP-11/10 to support an hour long module which we have incorporated into our computer organization course for the past few semest...
John A. N. Lee
INFOCOM
1998
IEEE
14 years 2 months ago
Timer Reconsideration for Enhanced RTP Scalability
RTP, the Real Time Transport Protocol, has gained widespread acceptance as the transport protocol for voice and video on the Internet. Its companion control protocol, the Real Tim...
Jonathan Rosenberg, Henning Schulzrinne