Sciweavers

697 search results - page 15 / 140
» On the Theory of Average Case Complexity
Sort
View
JCC
2002
67views more  JCC 2002»
13 years 7 months ago
Quasi-degenerate perturbation theory with general multiconfiguration self-consistent field reference functions
: The quasi-degenerate perturbation theory (QDPT) with complete active space (CAS) self-consistent field (SCF) reference functions is extended to the general multiconfiguration (MC...
Haruyuki Nakano, Ryuma Uchiyama, Kimihiko Hirao
EOR
2008
136views more  EOR 2008»
13 years 7 months ago
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Ni...
MP
2006
107views more  MP 2006»
13 years 7 months ago
Convergence theory for nonconvex stochastic programming with an application to mixed logit
Monte Carlo methods have been used extensively in the area of stochastic programming. As with other methods that involve a level of uncertainty, theoretical properties are required...
Fabian Bastin, Cinzia Cirillo, Philippe L. Toint
ICTAI
1994
IEEE
13 years 12 months ago
A Knowledge Representation System for Integration of General and Case-Specific Knowledge
Combining various knowledge types - and reasoning methods - in knowledge-based systems is a challenge to the knowledge representation task. The paper describes an object-oriented,...
Agnar Aamodt
NAACL
2007
13 years 9 months ago
Worst-Case Synchronous Grammar Rules
We relate the problem of finding the best application of a Synchronous ContextFree Grammar (SCFG) rule during parsing to a Markov Random Field. This representation allows us to u...
Daniel Gildea, Daniel Stefankovic