Sciweavers

174 search results - page 28 / 35
» A Planning Scheduling Methodology for the Constrained Resour...
Sort
View
CONSTRAINTS
2002
129views more  CONSTRAINTS 2002»
14 years 9 months ago
Cost-Based Arc Consistency for Global Cardinality Constraints
A global cardinality constraint (gcc) is specified in terms of a set of variables X = {x1, ..., xp} which take their values in a subset of V = {v1, ..., vd}. It constrains the numb...
Jean-Charles Régin
79
Voted
WSC
2007
14 years 12 months ago
Optimal scheduling of probabilistic repetitive projects using completed unit and genetic algorithms
In this paper we introduce the completed unit algorithm (CU-AL), a probabilistic scheduling methodology for repetitive projects. The algorithm has two main advantages, simplicity ...
Chachrist Srisuwanrat, Photios G. Ioannou
CSCW
1998
ACM
15 years 1 months ago
Designing for the Dynamics of Cooperative Work Activities
CSCW seems to have a persistent problem of understanding the nature of “cooperative work”. This paper argues that this problem is a direct result of not looking at the dynamic...
Jakob Bardram
CP
2003
Springer
15 years 2 months ago
Open Constraint Optimization
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...
Boi Faltings, Santiago Macho-Gonzalez
CLUSTER
2008
IEEE
15 years 4 months ago
Empirical-based probabilistic upper bounds for urgent computing applications
—Scientific simulation and modeling often aid in making critical decisions in such diverse fields as city planning, severe weather prediction and influenza modeling. In some o...
Nick Trebon, Peter H. Beckman