193 search results - page 3 / 39 » Several ways to solve the MSO problem |
ISAAC
2001
Springer
13 years 9 months ago
2001
Springer
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions b...
CEEMAS
2007
Springer
13 years 9 months ago
2007
Springer
In farsighted MAS, every agent is aware of each other, and so they can evaluate the outcomes of their interaction in an efficient way. However, this farsighted knowledge becomes an...
EUROCRYPT
2003
Springer
13 years 10 months ago
2003
Springer
We introduce captcha, an automated test that humans can pass, but current computer programs can’t pass: any program that has high success over a captcha can be used to solve an u...
ESA
2007
Springer
13 years 11 months ago
2007
Springer
In this paper we study several routing problems that generalize shortest paths and the Traveling Salesman Problem. We consider a more general model that incorporates the actual co...
KDD
2010
ACM
13 years 7 months ago
2010
ACM
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...