3690 search results - page 77 / 738 » Computation with classical sequents |
DM
2008
14 years 10 months ago
2008
Rahilly [10] described a construction that relates any Hadamard design H on 4m -1 points with a line spread to an affine design having the same parameters as the classical design ...
CSJM
2006
14 years 10 months ago
2006
Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined -- a synthesis of classical TS...
112
click to vote
RSKT
2010
Springer
14 years 8 months ago
2010
Springer
A naive Bayesian classifier is a probabilistic classifier based on Bayesian decision theory with naive independence assumptions, which is often used for ranking or constructing a...
174
click to vote
Book
Classic book on Algorithmic aspects of Game theory and mechanism design
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We investigate here the computational complexity of three natural problems in directed acyclic graphs. We prove their NP Completeness and consider their restrictions to linear orde...