2636 search results - page 368 / 528 » Linear Programming |
123
Voted
ECAI
1992
Springer
15 years 6 months ago
1992
Springer
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...
122
click to vote
ICALP
1990
Springer
15 years 6 months ago
1990
Springer
Any tree can be represented in a max/ma//y compact form as a directed acyclic graph where common subtrees are factored and shared, being represented only once. Such a compaction ca...
164
click to vote
WSC
2008
15 years 5 months ago
2008
We consider a portfolio allocation problem where the objective function is a tail event such as probability of large portfolio losses. The dependence between assets is captured th...
104
Voted
DLT
2006
15 years 4 months ago
2006
This paper addresses the longstanding problem of the recognition limitations of classical LALR(1) parser generators by proposing the usage of noncanonical parsers. To this end, we...
130
click to vote
CORR
2008
Springer
15 years 2 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 ...