6142 search results - page 391 / 1229 » The Complexity of Partition Functions |
172
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
Parallel programming on distributed memory systems is one of the most challenging research areas in parallel computingtoday. Objectbased parallel programming languages are an impor...
148
Voted
DAC
1998
ACM
15 years 11 months ago
1998
ACM
Approximate reachability techniques trade o accuracy with the capacity to deal with bigger designs. Cho et al 3 proposed approximate FSM traversal algorithms over a partition of t...
176
click to vote
DAC
1989
ACM
15 years 10 months ago
1989
ACM
- New algorithms for high-level synthesis are presented. The first performs scheduling under hardware resource constraints and improves on commonly used list scheduling techniques ...
172
click to vote
KDD
1995
ACM
15 years 10 months ago
1995
ACM
Clustering is often used to discover structure in data. Clustering systems differ in the objective function used to evaluate clustering quality and the control strategy used to se...
175
click to vote
VL
1995
IEEE
15 years 10 months ago
1995
IEEE
A critical incident is reported where a discretionary user needed to partition the spreadsheet grid into an arithmetic series of blocks and apply a function to each, but was unabl...