Sciweavers

10997 search results - page 244 / 2200
» On the Structure of Complete Sets
Sort
View
APPROX
2006
Springer
88views Algorithms» more  APPROX 2006»
15 years 10 months ago
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
Leah Epstein, Magnús M. Halldórsson,...
IWPC
2006
IEEE
16 years 22 days ago
Dynamic Data Structure Analysis for Java Programs
Analysis of dynamic data structure usage is useful for both program understanding and for improving the accuracy of other program analyses. Static analysis techniques, however, su...
Sokhom Pheng, Clark Verbrugge
CDC
2008
IEEE
125views Control Systems» more  CDC 2008»
16 years 1 months ago
Dynamical structure analysis of sparsity and minimality heuristics for reconstruction of biochemical networks
— Network reconstruction, i.e. obtaining network structure from input-output information, is a central theme in systems biology. A variety of approaches aim to obtaining structur...
Russell Howes, Lee John Eccleston, Jorge M. Goncal...
SPIN
2005
Springer
16 years 5 days ago
Repairing Structurally Complex Data
We present a novel algorithm for repairing structurally complex data. Given an assertion that represents desired structural integrity constraints and a structure that violates them...
Sarfraz Khurshid, Iván García, Yuk L...
STACS
2005
Springer
16 years 5 days ago
The Core of a Countably Categorical Structure
ded abstract of this article is published in the proceedings of STACS’05, LNCS 3404, Springer Verlag. A relational structure is a core, if all its endomorphisms are embeddings. T...
Manuel Bodirsky