Sciweavers

344 search results - page 42 / 69
» The Directed Minimum Latency Problem
Sort
View
SIAMDM
2008
77views more  SIAMDM 2008»
14 years 11 months ago
The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
The Windy Postman Problem consists of finding a minimum cost traversal of all the edges of an undirected graph with two costs associated with each edge, representing the costs of ...
Angel Corberán, Isaac Plana, José M....
ACSD
2003
IEEE
103views Hardware» more  ACSD 2003»
15 years 5 months ago
Design Validation of ZCSP with SPIN
— We consider the problem of specifying a model of the Zero Copy Secured Protocol for the purpose of LTL verification with the SPIN Model Checker. ZCSP is based on Direct Memory...
Vincent Beaudenon, Emmanuelle Encrenaz, Jean Lou D...
ISPAN
2002
IEEE
15 years 4 months ago
An Overview of Data Replication on the Internet
The proliferation of the Internet is leading to high expectation on the fast turnaround time. Clients abandoning their connections due to excessive downloading delays translates d...
Thanasis Loukopoulos, Dimitris Papadias, Ishfaq Ah...
COCOON
2005
Springer
15 years 5 months ago
Genome Rearrangements with Partially Ordered Chromosomes
Genomic maps often do not specify the order within some groups of two or more markers. The synthesis of a master map from several sources introduces additional order ambiguity due ...
Chunfang Zheng, David Sankoff
ICCAD
2008
IEEE
170views Hardware» more  ICCAD 2008»
15 years 8 months ago
Obstacle-avoiding rectilinear Steiner tree construction
— In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important prob...
Liang Li, Evangeline F. Y. Young