3433 search results - page 257 / 687 » Heuristics for a bidding problem |
180
click to vote
WEA
2007
Springer
16 years 24 days ago
2007
Springer
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has ...
166
click to vote
ICTAI
2003
IEEE
15 years 12 months ago
2003
IEEE
Planning for numeric goals is an important problem. Only one of the many participants from the 2002 international planning competition (Metric-FF) can effectively handle problems ...
173
click to vote
EVOW
2010
Springer
15 years 10 months ago
2010
Springer
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
178
click to vote
COR
2006
15 years 6 months ago
2006
This paper considers the problem of scheduling two-operation non-preemptable jobs on two identical semiautomatic machines. A single server is available to carry out the first (or ...
196
click to vote
SDM
2012
SIAM
13 years 9 months ago
2012
SIAM
Outlier detection research is currently focusing on the development of new methods and on improving the computation time for these methods. Evaluation however is rather heuristic,...