4438 search results - page 736 / 888 » The Case for Collaborative Programming |
145
click to vote
CP
2004
Springer
15 years 10 months ago
2004
Springer
It is well known that the ratio of the number of clauses to the number of variables in a random k-SAT instance is highly correlated with the instance’s empirical hardness. We con...
120
Voted
CP
2004
Springer
15 years 10 months ago
2004
Springer
Cardinality matrix problems are the underlying structure of several real world problems such as rostering, sports scheduling , and timetabling. These are hard computational problem...
131
click to vote
CPAIOR
2004
Springer
15 years 10 months ago
2004
Springer
Abstract In recent years, the Constraint Programming (CP) and Operations Research (OR) communities have explored the advantages of combining CP and OR techniques to formulate and s...
151
click to vote
DFG
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Today's manufacturing industry demands flexible and decentralized production control systems to avoid hours of down time of the production line in case of a failure ...
147
click to vote
ICALP
2004
Springer
15 years 10 months ago
2004
Springer
We present a domain-theoretic version of Picard’s theorem for solving classical initial value problems in Rn . For the case of vector fields that satisfy a Lipschitz condition, ...