592 search results - page 98 / 119 » Using Constraint Programming to Solve the Maximum Clique Pro... |
AGENTS
2000
Springer
15 years 4 months ago
2000
Springer
Many applied problems in domains such as military operations, manufacturing, and logistics require that entities change location under certain constraints. These problems are trad...
COR
2008
14 years 11 months ago
2008
Introducing a new concept of (, )-fairness, which allows for a bounded fairness compromise, so that a source is allocated a rate neither less than 0 1, nor more than 1, times...
115
click to vote
PPDP
2010
Springer
14 years 10 months ago
2010
Springer
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...
118
click to vote
ORL
2006
14 years 11 months ago
2006
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
127
click to vote
POPL
1992
ACM
15 years 3 months ago
1992
ACM
Semantics for a Higher-Order Functional Language with Logic Variables Radha Jagadeesan Imperial College, London, UK SW7 2BZ. Keshav Pingali Cornell University, Ithaca, NY 14853. A...