3818 search results - page 172 / 764 » Word Problems on Compressed Words |
155
click to vote
JPDC
2008
15 years 6 months ago
2008
This paper proposes a variation of the Byzantine generals problem (or Byzantine consensus). Each general has a set of good plans and a set of bad plans. The problem is to make all...
135
Voted
MOR
2006
15 years 6 months ago
2006
We consider optimization problems involving convex risk functions. By employing techniques of convex analysis and optimization theory in vector spaces of measurable functions we d...
155
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
We show that neither Resolution nor tree-like Resolution is automatizable unless the class W[P] from the hierarchy of parameterized problems is fixed-parameter tractable by randomi...
156
click to vote
AMC
2005
15 years 6 months ago
2005
In this paper, we present an application of 0-1 linear programming problem in the indentification of the nondominated paths on a network. To find efficient paths, an adaptationof t...
146
Voted
IPL
2007
15 years 6 months ago
2007
We present a new proof of PSPACE-hardness of the emptiness problem for alternating finite automata with a singleton alphabet. This result was shown by Holzer (1995) who used a pr...