Sciweavers

5055 search results - page 672 / 1011
» Relative Timing
Sort
View
ESA
2005
Springer
162views Algorithms» more  ESA 2005»
16 years 9 days ago
Minimal Interval Completions
We study the problem of adding edges to an arbitrary graph so that the resulting graph is an interval graph. Our objective is to add an inclusion minimal set of edges, which means ...
Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve...
FC
2005
Springer
171views Cryptology» more  FC 2005»
16 years 9 days ago
Identity-Based Partial Message Recovery Signatures (or How to Shorten ID-Based Signatures)
Abstract. We firstly proposed a new notion of short identity-based signature scheme. We argue that the identity-based environment is essential in some scenarios. The notion of sho...
Fangguo Zhang, Willy Susilo, Yi Mu
GECCO
2005
Springer
106views Optimization» more  GECCO 2005»
16 years 9 days ago
Fitness uniform deletion: a simple way to preserve diversity
A commonly experienced problem with population based optimisation methods is the gradual decline in population diversity that tends to occur over time. This can slow a system’s ...
Shane Legg, Marcus Hutter
HM
2005
Springer
98views Optimization» more  HM 2005»
16 years 9 days ago
A Hybrid GRASP with Data Mining for the Maximum Diversity Problem
Abstract. The maximum diversity problem (MDP) consists in identifying, in a population, a subset of elements, characterized by a set of attributes, that present the most diverse ch...
L. F. Santos, Marcos Henrique Ribeiro, Alexandre P...
189
Voted
ICCNMC
2005
Springer
16 years 8 days ago
An Aided Congestion Avoidance Mechanism for TCP Vegas
TCP Vegas detects network congestion in the early stage and successfully prevents periodic packet loss that usually occurs in TCP Reno. It has been demonstrated that TCP Vegas achi...
Cheng-Yuan Ho, Chen-Hua Shih, Yaw-Chung Chen, Yi-C...