2917 search results - page 281 / 584 » Satisfying Interaction Constraints |
173
click to vote
INFOCOM
2000
IEEE
15 years 11 months ago
2000
IEEE
Abstract—We study a network model in which each network link is associated with a set of delays and costs. These costs are a function of the delays and reflect the prices paid i...
181
click to vote
INFOCOM
1998
IEEE
15 years 11 months ago
1998
IEEE
We consider the problem of routing connections with quality of service (QoS) requirements across networks when the information available for making routing decisions is inaccurate....
217
click to vote
CAV
2004
Springer
15 years 10 months ago
2004
Springer
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...
181
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: High throughput sequencing (HTS) platforms produce gigabases of short read (<100 bp) data per run. While these short reads are adequate for resequencing application...
163
click to vote
CONSTRAINTS
2007
15 years 6 months ago
2007
In the ECAD area, the Test Generation (TG) problem consists in finding an input vector test for some possible diagnosis (a set of faults) of a digital circuit. Such tests may have ...