2864 search results - page 241 / 573 » Constraint Programming in OPL |
171
click to vote
CADE
2001
Springer
16 years 4 months ago
2001
Springer
The modalities of Dynamic Logic refer to the final state of a program execution and allow to specify programs with pre- and postconditions. In this paper, we extend Dynamic Logic w...
133
click to vote
AAAI
1996
15 years 6 months ago
1996
We describe a program called SketchIT that transforms a single sketch of a mechanical device into multiple families of new designs. It represents each of these families with a &qu...
DATE
2007
IEEE
15 years 11 months ago
2007
IEEE
This paper presents a task scheduling method for reliable cache architectures (RCAs) of multiprocessor systems. The RCAs dynamically switch their operation modes for reducing the ...
114
click to vote
CP
2003
Springer
15 years 9 months ago
2003
Springer
How do we identify inconsistent CSPs quickly? This paper presents relaxation as one possible method; showing how we can generate relaxed CSPs which are easier to prove inconsistent...
245
Voted
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
This paper proposes a method for dealing with numerical attributes in inductive concept learning systems based on genetic algorithms. The method uses constraints for restricting th...