Sciweavers

5606 search results - page 430 / 1122
» Randomization Techniques for Graphs.
Sort
View
VALUETOOLS
2006
ACM
149views Hardware» more  VALUETOOLS 2006»
16 years 21 days ago
Tail asymptotics for discrete event systems
In the context of communication networks, the framework of stochastic event graphs allows a modeling of control mechanisms induced by the communication protocol and an analysis of ...
Marc Lelarge
STACS
2005
Springer
16 years 6 days ago
Connectivity for Wireless Agents Moving on a Cycle or Grid
Abstract. We present a mathematical model to analyse the establishment and maintenance of communication between mobile agents. We assume that the agents move through a fixed envir...
Josep Díaz-Giménez, Xavier Pé...
ISCAS
2003
IEEE
116views Hardware» more  ISCAS 2003»
16 years 18 hour ago
Using FPGAs to solve the Hamiltonian cycle problem
The Hamiltonian Cycle (HC) problem is an important graph problem with many applications. The general backtracking algorithm normally used for random graphs often takes far too lon...
Micaela Serra, Kenneth B. Kent
ISAAC
2000
Springer
110views Algorithms» more  ISAAC 2000»
15 years 10 months ago
Online Routing in Convex Subdivisions
We consider online routing algorithms for finding paths between the vertices of plane graphs. We show (1) there exists a routing algorithm for arbitrary triangulations that has no...
Prosenjit Bose, Pat Morin, Andrej Brodnik, Svante ...
ICPR
2010
IEEE
15 years 9 months ago
Topic-Sensitive Tag Ranking
Social tagging is an increasingly popular way to describe and classify documents on the web. However, the quality of the tags varies considerably since the tags are authored freel...
Yan'An Jin, Ruixuan Li, Zhengding Lu, Kunmei Wen, ...