Sciweavers

4313 search results - page 339 / 863
» Using time travel to diagnose computer problems
Sort
View
IPPS
2002
IEEE
16 years 14 days ago
On Cost-Optimal Merge of Two Intransitive Sorted Sequences
The problem of merging two intransitive sorted sequences (that is, to generate a sorted total order without the transitive property) is considered. A cost-optimal parallel merging...
Jie Wu, Stephan Olariu
DAC
1995
ACM
15 years 11 months ago
Interval Scheduling: Fine-Grained Code Scheduling for Embedded Systems
Abstract A central problem in embedded system co-synthesis is the generation of software for lowlevel I O. Scheduling still remains a manual task because existing coarse-grained re...
Pai H. Chou, Gaetano Borriello
FOCS
1991
IEEE
15 years 11 months ago
Dynamic Three-Dimensional Linear Programming
We perform linear programming optimizations on the intersection of k polyhedra in R3 , represented by their outer recursive decompositions, in expected time O(k log k log n + √ ...
David Eppstein
ANOR
2008
69views more  ANOR 2008»
15 years 7 months ago
Scheduling vessels and container-yard operations with conflicting objectives
Abstract We consider the problem of coordinating the operations of two supply chain partners: a foreign shipping company and a domestic port. The two partners have conflicting busi...
Endre Boros, Lei Lei, Yao Zhao, Hua Zhong
SC
2005
ACM
16 years 1 months ago
Parallel Programmer Productivity: A Case Study of Novice Parallel Programmers
In developing High-Performance Computing (HPC) software, time to solution is an important metric. This metric is comprised of two main components: the human effort required develo...
Lorin Hochstein, Jeffrey Carver, Forrest Shull, Si...