Sciweavers

105 search results - page 20 / 21
» Euler's Partition Theorem
Sort
View
131
Voted
KR
2010
Springer
15 years 8 months ago
Decomposing Description Logic Ontologies
Recent years have seen the advent of large and complex ontologies, most notably in the medical domain. As a consequence, structuring mechanisms for ontologies are nowadays viewed ...
Boris Konev, Carsten Lutz, Denis Ponomaryov, Frank...
ICCAD
2000
IEEE
109views Hardware» more  ICCAD 2000»
15 years 8 months ago
General Models for Optimum Arbitrary-Dimension FPGA Switch Box Designs
–An FPGA switch box is said to be hyper-universal if it is routable for all possible surrounding multi-pin net topologies satisfying the routing resource constraints. It is desir...
Hongbing Fan, Jiping Liu, Yu-Liang Wu
133
Voted
SODA
2008
ACM
96views Algorithms» more  SODA 2008»
15 years 5 months ago
Greedy drawings of triangulations
Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide...
Raghavan Dhandapani
134
Voted
FMICS
2010
Springer
15 years 4 months ago
SMT-Based Formal Verification of a TTEthernet Synchronization Function
Abstract. TTEthernet is a communication infrastructure for mixedcriticality systems that integrates dataflow from applications with different criticality levels on a single network...
Wilfried Steiner, Bruno Dutertre
CORR
2008
Springer
110views Education» more  CORR 2008»
15 years 3 months ago
Trimmed Moebius Inversion and Graphs of Bounded Degree
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...
Andreas Björklund, Thore Husfeldt, Petteri Ka...