11740 search results - page 171 / 2348 » More Problems in Rewriting |
150
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...
125
click to vote
EOR
2008
15 years 4 months ago
2008
We consider an extension of the optimal searcher path problem (OSP), where a searcher moving through a discretised environment may now need to spend a nonuniform amount of time tr...
149
click to vote
STTT
2008
15 years 4 months ago
2008
Abstract This paper is about tool support for knowledgeintensive engineering tasks. In particular, it introduces software technology to assist the design of complex technical syste...
148
click to vote
IPPS
2010
IEEE
15 years 2 months ago
2010
IEEE
We consider the problem of scheduling jobs on a pool of machines. Each job requires multiple machines on which it executes in parallel. For each job, the input specifies release ti...
147
click to vote
AMAI
2010
Springer
15 years 1 months ago
2010
Springer
Constraints and quantitative preferences, or costs, are very useful for modelling many real-life problems. However, in many settings, it is difficult to specify precise preference ...