6939 search results - page 1035 / 1388 » Algorithm Engineering for Parallel Computation |
131
click to vote
ICFP
2003
ACM
16 years 4 months ago
2003
ACM
Under the widely believed conjecture P=NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete pro...
130
Voted
GLVLSI
2006
IEEE
15 years 11 months ago
2006
IEEE
Most of the logic synthesis algorithms are not scalable for large networks and, for this reason, partitioning is often applied. However traditional mincut-based partitioning techn...
131
click to vote
SOCO
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Service discovery and service aggregation are two crucial issues in the emerging area of Service-oriented Computing (SoC). We propose a new technique for the discovery of...
130
click to vote
FSTTCS
2004
Springer
15 years 10 months ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
132
Voted
ICRA
2003
IEEE
15 years 10 months ago
2003
IEEE
Robotic simulation systems allow researchers, engineers, and students to test control algorithms in a safe environment, but until recently these systems only simulated the dynamic...