Sciweavers

2141 search results - page 203 / 429
» A distance model for rhythms
Sort
View
INFOCOM
2000
IEEE
15 years 11 months ago
Performance Comparison of Two On-demand Routing Protocols for Ad Hoc Networks
Ad hoc networks are characterized by multihop wireless connectivity, frequently changing network topology and the need for efficient dynamic routing protocols. We compare the perf...
Samir Ranjan Das, Charles E. Perkins, Elizabeth M....
ESA
2000
Springer
104views Algorithms» more  ESA 2000»
15 years 10 months ago
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Ma...
WSC
2008
15 years 8 months ago
SR-1: A simulation-based algorithm for the Capacitated Vehicle Routing Problem
In this paper we present SR-1, a simulation-based heuristic algorithm for the Capacitated Vehicle Routing Problem (CVRP). Given a CVRP instance, SR-1 uses an initial "good so...
Javier Faulin, Miquel Gilibert, Angel A. Juan, Xav...
ADHOCNOW
2008
Springer
15 years 7 months ago
Communication in Random Geometric Radio Networks with Positively Correlated Random Faults
Abstract. We study the feasibility and time of communication in random geometric radio networks, where nodes fail randomly with positive correlation. We consider a set of radio sta...
Evangelos Kranakis, Michel Paquette, Andrzej Pelc
ISVC
2010
Springer
15 years 7 months ago
A Meshless Method for Variational Nonrigid 2-D Shape Registration
We present a method for nonrigid registration of 2-D geometric shapes. Our contribution is twofold. First, we extend the classic chamfer-matching energy to a variational functional...
Wei Liu, Eraldo Ribeiro