306 search results - page 18 / 62 » On the Minimal Uncompletable Word Problem |
EOR
2006
14 years 11 months ago
2006
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
100
click to vote
ADHOCNOW
2008
Springer
15 years 6 months ago
2008
Springer
We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in ...
117
click to vote
WADS
2007
Springer
15 years 5 months ago
2007
Springer
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...
COMPUTING
2006
14 years 11 months ago
2006
We consider the problem of splitting a symmetric positive definite (SPD) stiffness matrix A arising from finite element discretization into the sum of edge matrices thereby assumi...
COGSCI
2010
14 years 11 months ago
2010
We created paired moral dilemmas with minimal contrasts in wording, a research strategy that has been advocated as a way to empirically establish principles operative in a domain-...