Sciweavers

12334 search results - page 315 / 2467
» The Use of C
Sort
View
ISAAC
2007
Springer
183views Algorithms» more  ISAAC 2007»
16 years 26 days ago
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
Sounaka Mishra, Venkatesh Raman, Saket Saurabh, So...
3DPVT
2002
IEEE
121views Visualization» more  3DPVT 2002»
15 years 11 months ago
Analysis of Secondary Structure Elements of Proteins Using Indexing Techniques
In this paper we present a method for protein structure comparison that is based on indexing. Unlike most methods using indexing, ours does not use invariants of the C atoms of th...
Concettina Guerra, Stefano Lonardi, Giuseppe Zanot...
ASPDAC
2005
ACM
103views Hardware» more  ASPDAC 2005»
15 years 8 months ago
MAIA: a framework for networks on chip generation and verification
- The increasing complexity of SoCs makes networks on chip (NoC) a promising substitute for busses and dedicated wires interconnection schemes. However, new tools need to be develo...
Luciano Ost, Aline Mello, José Palma, Ferna...
JUCS
2007
120views more  JUCS 2007»
15 years 6 months ago
Compile-time Computation of Polytime Functions
: We investigate the computational power of C++ compilers. In particular, it is known that any partial recursive function can be computed at compile time, using the template mechan...
Emanuele Covino, Giovanni Pani, Daniele Scrimieri
DATE
2007
IEEE
85views Hardware» more  DATE 2007»
16 years 1 months ago
Timing simulation of interconnected AUTOSAR software-components
AUTOSAR is a recent specification initiative which focuses on a model-driven architecture like methodology for automotive applications. However, needed engineering steps, or how-t...
Matthias Krause, Oliver Bringmann, André He...