Sciweavers

17967 search results - page 3229 / 3594
» Functional timing optimization
Sort
View
ECCC
2007
122views more  ECCC 2007»
15 years 4 months ago
Infeasibility of Instance Compression and Succinct PCPs for NP
The OR-SAT problem asks, given Boolean formulae φ1, . . . , φm each of size at most n, whether at least one of the φi’s is satisfiable. We show that there is no reduction fr...
Lance Fortnow, Rahul Santhanam
MIS
2008
Springer
191views Multimedia» more  MIS 2008»
15 years 4 months ago
QoS management and control for an all-IP WiMAX network architecture: Design, implementation and evaluation
The IEEE 802.16 standard provides a specification for a fixed and mobile broadband wireless access system, offering high data rate transmission of multimedia services with differen...
Thomas Michael Bohnert, Marco Castrucci, Nicola Ci...
JSAT
2006
91views more  JSAT 2006»
15 years 4 months ago
Extending Existential Quantification in Conjunctions of BDDs
Abstract. We introduce new approaches intended to speed up determining the satisfiability of a given Boolean formula expressed as a conjunction of Boolean functions. A common prac...
Sean Weaver, John V. Franco, John S. Schlipf
MICRO
2006
IEEE
94views Hardware» more  MICRO 2006»
15 years 4 months ago
A Sampling Method Focusing on Practicality
In the past few years, several research works have demonstrated that sampling can drastically speed up architecture simulation, and several of these sampling techniques are already...
Daniel Gracia Pérez, Hugues Berry, Olivier ...
147
Voted
GPEM
2007
119views more  GPEM 2007»
15 years 4 months ago
Genomic mining for complex disease traits with "random chemistry"
Our rapidly growing knowledge regarding genetic variation in the human genome offers great potential for understanding the genetic etiology of disease. This, in turn, could revolut...
Margaret J. Eppstein, Joshua L. Payne, Bill C. Whi...
« Prev « First page 3229 / 3594 Last » Next »