934 search results - page 106 / 187 » A theoretical analysis of the HIFF problem |
AAAI
2004
14 years 11 months ago
2004
Tabu search algorithms are amongst the most successful local search based methods for the maximum satisfiability problem. The practical superiority of tabu search over the local s...
DAGSTUHL
2006
14 years 11 months ago
2006
Partially ordered sets, causets, partially ordered spaces and their local counterparts are now often used to model systems in computer science and theoretical physics. The order mo...
ECIS
2003
14 years 11 months ago
2003
Research problems in ICT networks often comprise coordination problems of information infrastructures and require state-of-the-art methods of coping with complex system dynamics. ...
NIPS
2001
14 years 11 months ago
2001
We derive an equivalence between AdaBoost and the dual of a convex optimization problem, showing that the only difference between minimizing the exponential loss used by AdaBoost ...
JIFS
2007
14 years 9 months ago
2007
We present a solution to the winner determination problem which takes into account not only costs but also risk aversion of the agent that accepts the bids, and which works for au...