4526 search results - page 154 / 906 » Algorithmic problems related to the Internet |
135
click to vote
IJCAI
2003
15 years 5 months ago
2003
Many of standard practical techniques of solving constraint satisfaction problems use various decomposition methods to represent a problem as a combination of smaller ones. We stu...
151
click to vote
IJCAI
2001
15 years 5 months ago
2001
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...
139
click to vote
CPAIOR
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we present a destructive lower bound for a number of resource constrained project scheduling (RCPS) problems, which is based on column generation. We first look at t...
156
click to vote
ICSE
1993
IEEE-ACM
15 years 8 months ago
1993
IEEE-ACM
We give examples of situations where formal specifications of procedures in the standard pre/postcondition style become lengthy, cumbersome and difficult to change, a problem whic...
121
click to vote
COR
2010
15 years 4 months ago
2010
The Flexible Job Shop scheduling Problem (FJSP) is a generalization of the classical Job Shop Problem in which each operation must be processed on a given machine chosen among a f...