417 search results - page 16 / 84 » Generalization Bounds for Some Ordinal Regression Algorithms |
AAAI
2007
13 years 10 months ago
2007
Local search is widely applied to satisfiable SAT problems, and on some problem classes outperforms backtrack search. An intriguing challenge posed by Selman, Kautz and McAlleste...
STOC
2007
ACM
14 years 8 months ago
2007
ACM
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
JUCS
2008
13 years 8 months ago
2008
: Since all the algebras connected to logic have, more or less explicitely, an associated order relation, it follows that they have two presentations, dual to each other. We classi...
PODC
2009
ACM
14 years 9 months ago
2009
ACM
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
ISSAC
2007
Springer
14 years 2 months ago
2007
Springer
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...