14518 search results - page 264 / 2904 » Two Problems for Sophistication |
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. This paper tackles three algorithmic problems for probabilistic automata on finite words: the Emptiness Problem, the Isolation Problem and the Value 1 Problem. The Empti...
DFG
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. The new millennium is characterized by speed and distribution in every aspect of most business and organization undertaking. Organizations are challenged to bring ideas a...
103
click to vote
FPCA
1995
15 years 4 months ago
1995
This paper discusses the derivation of functional programs for grammar analysis problems, such as the Empty problem and the Reachable problem. Grammar analysis problems can be div...
112
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
ESEM
2009
ACM
15 years 4 months ago
2009
ACM
Existing studies on problem reports in open source projects focus primarily on the analysis of the general category of problem reports, or limit their attention to observations on...