Sciweavers

4401 search results - page 389 / 881
» Computing with Default Logic
Sort
View
DAC
1996
ACM
15 years 11 months ago
Delay Minimal Decomposition of Multiplexers in Technology Mapping
Technology mapping requires the unmapped logic network to be represented in terms of base functions, usually two-input NORs and inverters. Technology decomposition is the step tha...
Shashidhar Thakur, D. F. Wong, Shankar Krishnamoor...
ICAC
2009
IEEE
15 years 10 months ago
A decentralized, architecture-based framework for self-growing applications
In large-scale, distributed software systems, an important management undertaking concerns the creation and runtime modification of application instances. This short paper propose...
Ada Diaconescu, Philippe Lalanda
BROADNETS
2004
IEEE
15 years 10 months ago
A Scalable Algorithm for Survivable Routing in IP-Over-WDM Networks
In IP-over-WDM networks, a logical IP network has to be routed on top of a physical optical fiber network. An important challenge hereby is to make the routing survivable. We call...
Frederick Ducatelle, Luca Maria Gambardella
BIRTHDAY
2006
Springer
15 years 10 months ago
Complete Categorical Deduction for Satisfaction as Injectivity
Birkhoff (quasi-)variety categorical axiomatizability results have fascinated many scientists by their elegance, simplicity and generality. The key factor leading to their generali...
Grigore Rosu
RTA
2000
Springer
15 years 10 months ago
Parallelism Constraints
Parallelism constraints are logical descriptions of trees. Parallelism constraints subsume dominance constraints and are equal in expressive power to context unification. Paralleli...
Katrin Erk, Joachim Niehren