Sciweavers

27 search results - page 3 / 6
» Path bundles on n-cubes
Sort
View
ICNP
2002
IEEE
14 years 9 days ago
An Investigation of Inter-Domain Control Aggregation Procedures
Current Quality of Service models such as those embodied in the Differentiated Services proposals, rely on data path aggregation to achieve scalability. Data path aggregation bund...
Rute Sofia, Roch Guérin, Pedro Veiga
ATMOS
2010
163views Optimization» more  ATMOS 2010»
13 years 6 months ago
Railway Track Allocation by Rapid Branching
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway netw...
Ralf Borndörfer, Thomas Schlechte, Steffen We...
TASLP
2008
96views more  TASLP 2008»
13 years 7 months ago
Fast Tracing of Acoustic Beams and Paths Through Visibility Lookup
The beam tracing method can be used for the fast tracing of a large number of acoustic paths through a direct lookup of a special tree-like data structure (beam tree) that describe...
Fabio Antonacci, M. Foco, Augusto Sarti, Stefano T...
ICCAD
2005
IEEE
113views Hardware» more  ICCAD 2005»
14 years 4 months ago
Synthesis methodology for built-in at-speed testing
We discuss a new synthesis flow, which offers the ability to do easy delay testing almost free in terms of its impact on speed and area as compared to corresponding implementation...
Yinghua Li, Alex Kondratyev, Robert K. Brayton
INFORMATICALT
2007
111views more  INFORMATICALT 2007»
13 years 7 months ago
Sequent Calculi for Branching Time Temporal Logics of Knowledge and Belief
In this paper we consider branching time temporal logics of knowledge and belief. These logics involve the discrete time linear temporal logic operators “next” and “until” ...
Jurate Sakalauskaite