11910 search results - page 407 / 2382 » Online Learning Algorithms |
185
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
229
click to vote
JCSS
2008
15 years 6 months ago
2008
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
179
Voted
GECCO
2003
Springer
15 years 12 months ago
2003
Springer
Over the last few years, a few approaches have been proposed aiming to combine genetic and evolutionary computation (GECCO) with inductive logic programming (ILP). The underlying r...
155
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
Experimentation of new algorithms is the usual companion section of papers dealing with SAT. However, the behavior of those algorithms is so unpredictable that even strong experime...
205
click to vote
EMNLP
2007
15 years 8 months ago
2007
Semantic inference is a core component of many natural language applications. In response, several researchers have developed algorithms for automatically learning inference rules...