Sciweavers

3663 search results - page 566 / 733
» Problems in the ontology of computer programs
Sort
View
SODA
1997
ACM
93views Algorithms» more  SODA 1997»
15 years 7 months ago
Fast Approximate Graph Partitioning Algorithms
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
COR
2007
80views more  COR 2007»
15 years 6 months ago
Scheduling with tool changes to minimize total completion time under controllable machining conditions
Scheduling under controllable machining conditions has been studied for some time. Scheduling with tool changes, particularly due to tool wear, has just begun to receive attention...
M. Selim Akturk, Jay B. Ghosh, Rabia K. Kayan
IPPS
2006
IEEE
16 years 15 days ago
Dynamic multi phase scheduling for heterogeneous clusters
Distributed computing systems are a viable and less expensive alternative to parallel computers. However, concurrent programming methods in distributed systems have not been studi...
Florina M. Ciorba, Theodore Andronikos, Ioannis Ri...
ICIP
2008
IEEE
16 years 8 months ago
Coding-gain-based complexity control for H.264 video encoder
The allowable computational complexity of video encoding is limited in a power-constrained system. Different video frames are associated with different motions and contexts, and s...
Ming-Chen Chien, Zong-Yi Chen, Pao-Chi Chang
BMCBI
2008
108views more  BMCBI 2008»
15 years 6 months ago
SPRINT: A new parallel framework for R
Background: Microarray analysis allows the simultaneous measurement of thousands to millions of genes or sequences across tens to thousands of different samples. The analysis of t...
Jon Hill, Matthew Hambley, Thorsten Forster, Murie...