10493 search results - page 255 / 2099 » Dynamic Word Problems |
140
click to vote
SODA
2001
ACM
15 years 3 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
168
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
106
click to vote
SIAMCOMP
2002
15 years 1 months ago
2002
Abstract. In the multiarmed bandit problem, a gambler must decide which arm of K nonidentical slot machines to play in a sequence of trials so as to maximize his reward. This class...
118
click to vote
SIAMNUM
2010
14 years 9 months ago
2010
A Balancing Domain Decomposition Method by Constraints (BDDC) is constructed and analyzed for the Reissner-Mindlin plate bending problem discretized with MITC finite elements. This...
104
click to vote
COCOA
2008
Springer
15 years 4 months ago
2008
Springer
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...