Sciweavers

3192 search results - page 294 / 639
» The minimum latency problem
Sort
View
SOFSEM
2009
Springer
16 years 1 months ago
Symbolic Reachability Analysis of Integer Timed Petri Nets
Petri nets are an effective formalism to model discrete event systems, and several variants have been defined to explicitly include real time in the model. We consider two fundam...
Min Wan, Gianfranco Ciardo
149
Voted
FAW
2009
Springer
177views Algorithms» more  FAW 2009»
15 years 11 months ago
Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs
Data access time becomes the main bottleneck in applications dealing with large-scale graphs. Cache-oblivious layouts, constructed to minimize the geometric mean of arc lengths of ...
Mohammad Khairul Hasan, Sung-Eui Yoon, Kyung-Yong ...
GLOBECOM
2008
IEEE
15 years 11 months ago
Dynamic Wavelength Routing in WDM Networks under Multiple Signal Quality Constraints
—Most research works in routing and design of optical networks assume that the optical medium can carry signals without any bit error. However, the physical impairments on the op...
Weiyi Zhang, Guoliang Xue, Jian Tang, Krishnaiyan ...
153
Voted
IAT
2007
IEEE
15 years 11 months ago
Reactive Agent Mechanisms for Manufacturing Process Control
In this paper we face a problem for chemical processes in a production system; items should undergo chemical reactions in different baths to be processed by the system. Recipes f...
Kasper Hallenborg, Ask Just Jensen, Yves Demazeau
GD
2007
Springer
15 years 11 months ago
Moving Vertices to Make Drawings Plane
In John Tantalo’s on-line game Planarity the player is given a non-plane straight-line drawing of a planar graph. The aim is to make the drawing plane as quickly as possible by m...
Xavier Goaoc, Jan Kratochvíl, Yoshio Okamot...