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...
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...
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...
—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...
— 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...