103 search results - page 6 / 21 » The Linear Ordering Problem with cumulative costs |
SIAMCOMP
2002
13 years 7 months ago
2002
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
SIBGRAPI
2005
IEEE
14 years 28 days ago
2005
IEEE
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...
IOR
2008
13 years 7 months ago
2008
When a manufacturer places repeated orders with a supplier to meet changing production requirements, he faces the challenge of finding the right balance between holding costs and ...
MICRO
2005
IEEE
14 years 28 days ago
2005
IEEE
Scheduling algorithms used in compilers traditionally focus on goals such as reducing schedule length and register pressure or producing compact code. In the context of a hardware...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
This paper deals with fair assignment problems in decision contexts involving multiple agents. In such problems, each agent has its own evaluation of costs and we want to find a f...