Sciweavers

2473 search results - page 123 / 495
» The Logic of Communication Graphs
Sort
View
JGAA
1998
116views more  JGAA 1998»
13 years 8 months ago
New Lower Bounds For Orthogonal Drawings
An orthogonal drawing of a graph is an embedding of the graph in the two-dimensional grid such that edges are routed along grid-lines. In this paper we explore lower bounds for or...
Therese C. Biedl
EDO
2000
Springer
14 years 21 days ago
Distributed Proxy: A Design Pattern for the Incremental Development of Distributed Applications
Developing a distributed application is hard due to the complexity inherent to distributed communication. Moreover, distributed object communication technology is always changing,...
António Rito Silva, Francisco Assis Rosa, T...
INFOCOM
2003
IEEE
14 years 2 months ago
Design of Light-Tree Based Logical Topologies for Multicast Streams in Wavelength Routed Optical Networks
—In this paper, we formulate an optimization problem for the design of light-tree based logical topology in Wavelength Division Multiplexing (WDM) networks. The problem is compri...
Wanjiun Liao
CSL
2008
Springer
13 years 11 months ago
On Counting Generalized Colorings
Abstract. The notion of graph polynomials definable in Monadic Second Order Logic, MSOL, was introduced in [Mak04]. It was shown that the Tutte polynomial and its generalization, a...
Tomer Kotek, Johann A. Makowsky, Boris Zilber
NGC
2007
Springer
171views Communications» more  NGC 2007»
13 years 8 months ago
Description Logics with Contraries, Contradictories, and Subcontraries
Several constructive description logics,12) in which classical negation was replaced by strong negation as a component to treat negative atomic information have been proposed as in...
Ken Kaneiwa