6542 search results - page 1163 / 1309 » The tao of parallelism in algorithms |
PODC
2004
ACM
14 years 3 months ago
2004
ACM
We propose a framework to translate certain subclasses of differential equation systems into distributed protocols that are practical. The synthesized protocols are state machine...
SPAA
2004
ACM
14 years 3 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
CP
2004
Springer
14 years 3 months ago
2004
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
EGH
2004
Springer
14 years 3 months ago
2004
Springer
Particle systems have long been recognized as an essential building block for detail-rich and lively visual environments. Current implementations can handle up to 10,000 particles...
CCGRID
2003
IEEE
14 years 3 months ago
2003
IEEE
— Since the advent of distributed computer systems an active field of research has been the investigation of scheduling strategies for parallel applications. The common approach...