Sciweavers

126 search results - page 7 / 26
» A Global Constraint for Total Weighted Completion Time
Sort
View
INFORMATICALT
2006
117views more  INFORMATICALT 2006»
14 years 9 months ago
Job Sequencing with Exponential Functions of Processing Times
We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times. For increasing functions, we prove strong NP-hardnes...
Adam Janiak, Mikhail Y. Kovalyov
ESCIENCE
2005
IEEE
15 years 3 months ago
A Platform for Distributed Analysis of Neuroimaging Data on Global Grids
This paper presents a Grid environment developed for analysis of MRI brain data on global Grids. In the current experiment, the MRI data analysis tasks are composed and formulated...
Scott Kolbe, Tianchi Ma, Wei Liu, Wee Siong Soh, R...
AAAI
2006
14 years 11 months ago
A BDD-Based Polytime Algorithm for Cost-Bounded Interactive Configuration
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...
Tarik Hadzic, Henrik Reif Andersen
87
Voted
SIGMOD
1996
ACM
131views Database» more  SIGMOD 1996»
15 years 1 months ago
Materialized View Maintenance and Integrity Constraint Checking: Trading Space for Time
We investigate the problem of incremental maintenance of an SQL view in the face of database updates, and show that it is possible to reduce the total time cost of view maintenanc...
Kenneth A. Ross, Divesh Srivastava, S. Sudarshan
93
Voted
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
15 years 2 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen