591 search results - page 45 / 119 » A constraint programming approach to cutset problems |
UML
2005
Springer
14 years 2 months ago
2005
Springer
Analysis and design by contract allows the definition of a formal agreement between a class and its clients, expressing each party’s rights and obligations. Contracts written in ...
CP
2004
Springer
14 years 1 months ago
2004
Springer
In CP literature combinatorial design problems such as sport scheduling, Steiner systems, error-correcting codes and more, are typically solved using Finite Domain (FD) models desp...
ECOOP
2009
Springer
14 years 9 months ago
2009
Springer
Contemporary refactoring tools for JAVA aiding in the restructuring of programs have problems with respecting access modifiers such as public and private: while some tools provide ...
FLAIRS
2008
13 years 9 months ago
2008
This paper describes an algorithm developed as a decision support system for SMT line operators and its purpose is to suggest changes in an existing feeder setup in order to impro...
TASE
2008
IEEE
13 years 8 months ago
2008
IEEE
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...