10493 search results - page 499 / 2099 » Dynamic Word Problems |
151
click to vote
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...
171
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
![Resolution Is Not Automatizable Unless W[P] Is Tractable](http://sciweavers.com/files/imagecache/thumbnail/default/content.jpg "Resolution Is Not Automatizable Unless W[P] Is Tractable")
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...
170
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...
167
click to vote
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...
178
click to vote
JOT
2007
15 years 6 months ago
2007
Beware of the colleague or supplier who spends large amounts of time in meetings discussing the format, sequence, and wording of documents they will deliver and very little time o...