Sciweavers

48 search results - page 7 / 10
» Total interval numbers of complete r-partite graphs
Sort
View
ANSS
2002
IEEE
14 years 13 days ago
Temporal Uncertainty Time Warp: An Agent-Based Implementation
This paper introduces TUTW – Temporal Uncertainty Time Warp – a control engine designed for an exploitation of temporal uncertainty (TU) in general optimistic simulations, and...
Roberto Beraldi, Libero Nigro, Antonino Orlando, F...
IWDC
2005
Springer
156views Communications» more  IWDC 2005»
14 years 29 days ago
Labeling Schemes for Tree Representation
This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The al...
Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, A...
BMCBI
2011
13 years 2 months ago
Analysis on the reconstruction accuracy of the Fitch method for inferring ancestral states
Background: As one of the most widely used parsimony methods for ancestral reconstruction, the Fitch method minimizes the total number of hypothetical substitutions along all bran...
Jialiang Yang, Jun Li, Liuhuan Dong, Stefan Gr&uum...
COR
2008
142views more  COR 2008»
13 years 7 months ago
Modeling and solving the rooted distance-constrained minimum spanning tree problem
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
Luis Gouveia, Ana Paias, Dushyant Sharma
ICDCS
2003
IEEE
14 years 23 days ago
Compiler Scheduling of Mobile Agents for Minimizing Overheads
Mobile code carried by a mobile agent can automatically travel to several data sources in order to complete a designated program. Traditionally, most mobile agent systems [7][8][1...
Xiaotong Zhuang, Santosh Pande