Sciweavers

3204 search results - page 524 / 641
» The Alcuin Number of a Graph
Sort
View
PASTE
2010
ACM
16 years 1 days ago
Opportunities for concurrent dynamic analysis with explicit inter-core communication
Multicore is now the dominant processor trend, and the number of cores is rapidly increasing. The paradigm shift to multicore forces the redesign of the software stack, which incl...
Jungwoo Ha, Stephen P. Crago
202
Voted
IPPS
1999
IEEE
15 years 11 months ago
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
Frank K. H. A. Dehne, David A. Hutchinson, Anil Ma...
ISLPED
1996
ACM
91views Hardware» more  ISLPED 1996»
15 years 11 months ago
Energy minimization using multiple supply voltages
We present a dynamic programming technique for solving the multiple supply voltage scheduling problem in both nonpipelined and functionally pipelined data-paths. The scheduling pro...
Jui-Ming Chang, Massoud Pedram
162
Voted
COMPGEOM
1990
ACM
15 years 11 months ago
Minimum-Link Paths Among Obstacles in the Plane
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...
Joseph S. B. Mitchell, Günter Rote, Gerhard J...
192
Voted
COCOA
2008
Springer
15 years 8 months ago
Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets
The multiple weighted hitting set problem is to find a subset of nodes in a hypergraph that hits every hyperedge in at least m nodes. We extend the problem to a notion of hypergra...
Peter Damaschke