Sciweavers

3820 search results - page 238 / 764
» Bounded Model Debugging
Sort
View
150
Voted
ICALP
2011
Springer
14 years 7 months ago
On the Advice Complexity of the k-Server Problem
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
Hans-Joachim Böckenhauer, Dennis Komm, Rastis...
138
Voted
VLSID
2006
IEEE
183views VLSI» more  VLSID 2006»
15 years 9 months ago
Design Challenges for High Performance Nano-Technology
This tutorial present the key aspects of design challenges and its solutions that are being experienced in VLSI design in the era of nano technology. The focus will be on design c...
Goutam Debnath, Paul J. Thadikaran
128
Voted
CODES
1999
IEEE
15 years 8 months ago
How standards will enable hardware/software co-design
o much higher levels of abstraction than today's design practices, which are usually at the level of synthesizable RTL for custom hardware or Instruction Set Simulator (ISS) f...
Mark Genoe, Christopher K. Lennard, Joachim Kunkel...
187
Voted
DISCO
1993
156views Hardware» more  DISCO 1993»
15 years 7 months ago
Variant Handling, Inheritance and Composition in the ObjectMath Computer Algebra Environment
ObjectMath is a high-level programming environment and modeling language for scientific computing which supports variants and graphical browsing in the environment and integrates o...
Peter Fritzson, Vadim Engelson, Lars Viklund
LATA
2009
Springer
15 years 10 months ago
Automata on Gauss Words
In this paper we investigate the computational complexity of knot theoretic problems and show upper and lower bounds for planarity problem of signed and unsigned knot diagrams repr...
Alexei Lisitsa, Igor Potapov, Rafiq Saleh