Sciweavers

1039 search results - page 159 / 208
» networks 1998
Sort
View
FSTTCS
2009
Springer
14 years 3 months ago
Iterative Methods in Combinatorial Optimization
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
R. Ravi
CONCUR
1999
Springer
14 years 1 months ago
Partial Order Reduction for Model Checking of Timed Automata
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
Marius Minea
NOMS
1998
IEEE
160views Communications» more  NOMS 1998»
14 years 1 months ago
SP-to-SP service ordering specification and its implementation
Network Management Forum (NMF) has defined a set of basic business processes dealing with major TMN service management functions such as performance management, fault management, b...
Graham Chen, Qinzheng Kong, Pierre-Yves Benain
TC
1998
13 years 8 months ago
The InfoPad Multimedia Terminal: A Portable Device for Wireless Information Access
—The architecture of a device that is optimized for wireless information access and display of multimedia data is substantially different than configurations designed for portabl...
Thomas E. Truman, Trevor Pering, Roger Doering, Ro...
TON
1998
71views more  TON 1998»
13 years 8 months ago
Real-time block transfer under a link-sharing hierarchy
— Most application data units are too large to be carried in a single packet (or cell) and must be segmented for network delivery. To an application, the end-to-end delays and lo...
Geoffrey G. Xie, Simon S. Lam