3818 search results - page 181 / 764 » Word Problems on Compressed Words |
182
click to vote
SODA
2001
ACM
15 years 7 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 ...
162
click to vote
TCS
1998
15 years 5 months ago
1998
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
222
click to vote
CORR
2007
Springer
15 years 6 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 ...
150
click to vote
SIAMCOMP
2002
15 years 5 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...
161
click to vote
SIAMNUM
2010
15 years 27 days 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...