Sciweavers

1225 search results - page 98 / 245
» The Instance Complexity Conjecture
Sort
View
IJFCS
2007
109views more  IJFCS 2007»
13 years 9 months ago
Computational Power of intramolecular gene Assembly
The process of gene assembly in ciliates, an ancient group of organisms, is one of the most complex instances of DNA manipulation known in any organism. Three molecular operations...
Tseren-Onolt Ishdorj, Ion Petre, Vladimir Rogojin
TOC
2008
89views more  TOC 2008»
13 years 9 months ago
Norms, XOR Lemmas, and Lower Bounds for Polynomials and Protocols
Abstract: This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and polynomials over GF(2)....
Emanuele Viola, Avi Wigderson
INTEGRATION
1998
96views more  INTEGRATION 1998»
13 years 8 months ago
BIST for systems-on-a-chip
An increasing part of microelectronic systems is implemented on the basis of predesigned and preverified modules, so-called cores, which are reused in many instances. Core-provide...
Hans-Joachim Wunderlich
WCRE
2009
IEEE
14 years 3 months ago
An Exploratory Study of the Impact of Code Smells on Software Change-proneness
—Code smells are poor implementation choices, thought to make object-oriented systems hard to maintain. In this study, we investigate if classes with code smells are more change-...
Foutse Khomh, Massimiliano Di Penta, Yann-Gaë...
LPNMR
1997
Springer
14 years 1 months ago
Power Defaults
This paper introduces power default reasoning (PDR), a framework for nonmonotonic reasoning based on the domain-theoretic idea of modeling default rules with partial-information i...
Guo-Qiang Zhang, William C. Rounds