569 search results - page 19 / 114 » An Empirical Study of Structural Constraint Solving Techniqu... |
175
click to vote
IFIP
2004
Springer
16 years 3 hour ago
2004
Springer
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
188
click to vote
IJCAI
1989
15 years 7 months ago
1989
gn problem can be abstractly characterized as a constrained function-to-structure mapping. The de sign task takes as input the specifications of the desired functions of a device...
158
click to vote
CSCW
2002
ACM
15 years 6 months ago
2002
ACM
In this paper, we first describe a formative empirical study to inform the design of CSCW tools to support idea finding in co-located groups. Groups of students worked on creative...
169
click to vote
EAAI
2008
15 years 6 months ago
2008
The criterion of total weighted completion time occurs as a sub-problem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage a...
146
click to vote
CP
2010
Springer
15 years 5 months ago
2010
Springer
A new interval constraint propagation algorithm, called MOnotonic Hull Consistency (Mohc), has recently been proposed. Mohc exploits monotonicity of functions to better filter var...