92 search results - page 14 / 19 » Optimal versus Heuristic Global Code Scheduling |
CP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Multi-Point Constructive Search maintains a small set of “elite solutions” that are used to heuristically guide constructive search through periodically restarting se...
CP
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...
89
Voted
IPPS
2003
IEEE
15 years 2 months ago
2003
IEEE
Partitioning and global scheduling are two approaches for scheduling real-time tasks on multiprocessors. Though partitioning is sub-optimal, it has traditionally been preferred; t...
CONEXT
2009
ACM
14 years 10 months ago
2009
ACM
Community wireless networks (CWNs) have been proposed to spread broadband network access to underprivileged, underprovisioned and remote areas. Research has focused on optimizing ...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—Network coding is a method that promises to achieve the min-cut capacity in multicasts. However, pushing towards this gain in throughput comes with two sacrifices. Delay suffer...