Sciweavers

306 search results - page 18 / 62
» On the Minimal Uncompletable Word Problem
Sort
View
EOR
2006
130views more  EOR 2006»
13 years 7 months ago
A Benders decomposition approach for the robust spanning tree problem with interval data
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...
Roberto Montemanni
ADHOCNOW
2008
Springer
14 years 1 months ago
Request Satisfaction Problem in Synchronous Radio Networks
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 ...
Benoît Darties, Sylvain Durand, Jér&o...
WADS
2007
Springer
155views Algorithms» more  WADS 2007»
14 years 1 months ago
Constant Factor Approximations for the Hotlink Assignment Problem
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...
Tobias Jacobs
COMPUTING
2006
126views more  COMPUTING 2006»
13 years 7 months ago
Algebraic Multigrid Based on Computational Molecules, 1: Scalar Elliptic Problems
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...
J. K. Kraus, Josef Schicho
COGSCI
2010
75views more  COGSCI 2010»
13 years 7 months ago
Moral Principles or Consumer Preferences? Alternative Framings of the Trolley Problem
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-...
Tage S. Rai, Keith J. Holyoak