Sciweavers

1772 search results - page 278 / 355
» Classifying Problems into Complexity Classes
Sort
View
BMCBI
2008
121views more  BMCBI 2008»
13 years 10 months ago
Modularization of biochemical networks based on classification of Petri net t-invariants
Background: Structural analysis of biochemical networks is a growing field in bioinformatics and systems biology. The availability of an increasing amount of biological data from ...
Eva Grafahrend-Belau, Falk Schreiber, Monika Heine...
DT
2000
88views more  DT 2000»
13 years 10 months ago
Postsilicon Validation Methodology for Microprocessors
f abstraction as applicable to break the problem's complexity, and innovating better techniques to address complexity of new microarchitectural features. Validation techniques...
Hemant G. Rotithor
PODS
2008
ACM
155views Database» more  PODS 2008»
14 years 10 months ago
The recovery of a schema mapping: bringing exchanged data back
A schema mapping is a specification that describes how data from a source schema is to be mapped to a target schema. Once the data has been transferred from the source to the targ...
Marcelo Arenas, Jorge Pérez, Cristian River...
SIGMETRICS
2005
ACM
118views Hardware» more  SIGMETRICS 2005»
14 years 3 months ago
Nearly insensitive bounds on SMART scheduling
We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the ...
Adam Wierman, Mor Harchol-Balter, Takayuki Osogami
CSFW
2010
IEEE
14 years 1 months ago
A Framework for the Sound Specification of Cryptographic Tasks
Nowadays it is widely accepted to formulate the security of a protocol carrying out a given task via the "trusted-party paradigm," where the protocol execution is compar...
Juan A. Garay, Aggelos Kiayias, Hong-Sheng Zhou