1016 search results - page 111 / 204 » Parallelism Constraints |
175
Voted
OL
2008
15 years 7 months ago
2008
By introducing redundant Klee-Minty examples, we have previously shown that the central path can be bent along the edges of the Klee-Minty cubes, thus having 2n - 2 sharp turns in...
193
Voted
ICDCSW
2005
IEEE
16 years 1 months ago
2005
IEEE
The core problem in risk analysis - determining exploitable paths between attackers and system assets is essentially a problem of determining information flow. It is relatively st...
242
click to vote
NIPS
2004
15 years 8 months ago
2004
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
177
Voted
ITC
2003
IEEE
16 years 20 days ago
2003
IEEE
This work discusses the impact of power consumption on the test time of core-based systems, when an available on-chip network is reused as test access mechanism. A previously prop...
158
Voted
SBCCI
2003
ACM
16 years 19 days ago
2003
ACM
Networks-on-Chip (NoCs) interconnection architectures to be used in future billion-transistor Systems-on-Chip (SoCs) meet the major communication requirements of these systems, of...