4047 search results - page 60 / 810 » Some Properties and Some Problems on Set Functors |
LPNMR
2009
Springer
15 years 4 months ago
2009
Springer
For some problems with many solutions, like planning and phylogeny reconstruction, one way to compute more desirable solutions is to assign weights to solutions, and then pick the ...
123
click to vote
EJC
2007
14 years 11 months ago
2007
We construct algorithms for deciding essentially any minor-closed parameter, with explicit time bounds. This result strengthens previous results by Robertson and Seymour [1,2], Fr...
101
click to vote
JALC
2006
14 years 11 months ago
2006
Formal methods are a popular means to specify and verify security properties of a variety of communication protocols. In this article we take a step towards the use of team automa...
114
click to vote
APPROX
2011
Springer
13 years 11 months ago
2011
Springer
In a well-known result Goldreich and Trevisan (2003) showed that every testable graph property has a “canonical” tester in which a set of vertices is selected at random and the...
NHM
2010
14 years 6 months ago
2010
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...