3433 search results - page 154 / 687 » Heuristics for a bidding problem |
163
click to vote
PARMA
2004
15 years 8 months ago
2004
The purpose of this paper is to study the problem of pattern classification as this is presented in the context of data mining. Among the various approaches we focus on the use of ...
152
click to vote
ISAAC
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. We consider the problems of hypergraph and minor crossing minimization, and point out a relation between these two problems which has not been exploited before. We presen...
169
click to vote
INFORMATICALT
2006
15 years 6 months ago
2006
We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times. For increasing functions, we prove strong NP-hardnes...
186
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
The Linear Ordering Problem(LOP), which is a well-known NP-hard problem, has numerous applications in various fields. Using this problem as an example, we illustrate a general pro...
147
click to vote
ICMCS
2007
IEEE
15 years 10 months ago
2007
IEEE
In this work, we investigate the routing problems ofminimizing the number ofdistinct transmission mediums or carrier domains for multimedia communications. We consider the problem...