Searching for authors named "Christos Nomikos" – sorted by Relevance.
7 documents found, showing 1 through 7.
-
Path Multi-Coloring: Exact and Approximate Solutions
- …Abstract In this paper we introduce and study the Path Multi-Coloring (PMC) problem: Given a graph, a set of paths, and a number w of colors, the goal is to find a color assignment to paths that minimizes color collisions on each edge. We consider simple topologies of degree two i.e. chains and ring…
- Add To MetaCart
-
A Stratification Test for Temporal Logic Programs
- …In this paper, we propose a new stratification test for linear-time temporal logic programs. More specifically, we extend the cycle-sum test [Ron01] to take into account negatively signed edges in the cycle-sum graph. In this way we broaden the class of temporal logic programs which are acceptable b…
- Cited by 2 (1 self) – Add To MetaCart
-
Fiber Cost Reduction and Wavelength Minimization in Multifiber WDM Networks
- …Motivated by the increasing importance of multifiber WDM networks we study two routing and wavelength assignment problems in such networks: -- Fiber Cost Minimization: the number of wavelengths per fiber is given and we want to minimize the cost of fiber links that need to be reserved in order …
- Cited by 4 (3 self) – Add To MetaCart
-
Minimizing Request Blocking in All-Optical Rings
- …In all-optical networks that use WDM technology it is often the case that several communication requests have to be blocked, due to bandwidth and technology limitations. Minimizing request blocking is therefore an important task calling for algorithmic techniques for efficient routing and wavelength…
- Cited by 8 (3 self) – Add To MetaCart
-
Strong Equivalence of Logic Programs under the Infinite-Valued Semantics
- …We consider the notion of strong equivalence [4] of normal propositional logic programs under the infinite-valued semantics [7] (which is a purely model-theoretic semantics that is compatible with the well-founded one). We demonstrate that two such programs are strongly equivalent under the infinite…
- Add To MetaCart
-
Routing and Wavelength Assignment in Multifiber WDM Networks with Non-Uniform Fiber Cost
- …Motivated by the increasing importance of multifiber WDM networks we study a routing and wavelength assignment problem in such networks. In this problem the number of wavelengths per fiber is given and the goal is to minimize the cost of fiber links that need to be reserved in order to satisfy a set…
- Cited by 1 (1 self) – Add To MetaCart
-
Theoretical Computer Science 342 (2005) 382 -- 415 www.el; vier.com/lxEfiy9FFE Temporal stratification tests forlrfi;; and branching-time deductive databases
- …We consider theprobl; of extendingtemporal deductive databases with stratified negation. We argue that theclfi:;7;F stratification test for deductive databases is too restrictive when one shifts attention to thetemporal case. Moreover, as we demonstrate, the (moregeneral lner stratification approach…
- Add To MetaCart
Showing 1 through 7.
