773 search results - page 139 / 155 » Traversing the Machining Graph |
184
click to vote
HICSS
2003
IEEE
15 years 10 months ago
2003
IEEE
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
161
click to vote
COLT
2003
Springer
15 years 10 months ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
176
click to vote
STACS
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
145
click to vote
ISCC
2002
IEEE
15 years 10 months ago
2002
IEEE
: - Efficient task scheduling is essential for achieving high performance computing applications for distributed systems. Most of existing real-time systems consider schedulability...
144
click to vote
ASPDAC
2000
ACM
15 years 9 months ago
2000
ACM
Abstract— Clock-gating techniques are very effective in the reduction of the switching activity in sequential logic circuits. In particular, recent work has shown that significa...