14518 search results - page 193 / 2904 » Two Problems for Sophistication |
ESANN
2008
14 years 7 days ago
2008
Adapting stimuli to stabilize neural responses is an important problem in the context of cortical prostheses. This paper describes two approaches for stimulus adaptation using supp...
DLOG
2004
14 years 5 days ago
2004
Recently, it was shown for the DL EL that subsumption and instance problem w.r.t. cyclic terminologies can be decided in polynomial time. In this paper, we show that both problems...
DM
2010
13 years 11 months ago
2010
We show that the firefighter problem is NP-complete for cubic graphs. We also show that given a rooted tree of maximum degree three in which every leaf is the same distance from t...
MP
2006
13 years 10 months ago
2006
We consider the vehicle routing problem where one can choose among vehicles with different costs and capacities to serve the trips. We develop six different formulations: the first...
SIAMDM
2008
13 years 10 months ago
2008
In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph Kn with n 2ck contains a K4 whose edges receive at most two colors. Th...