Sciweavers

1712 search results - page 41 / 343
» A Computational Approach to Binding Theory
Sort
View
ICCS
1997
Springer
15 years 4 months ago
Applying Conceptual Graph Theory to the User-Driven Specification of Network Information Systems
Users need to be strongly involved in the specification process of network information systems. Characteristics of user-driven specification are described, and process composition ...
Aldo de Moor
AIMS
2007
Springer
15 years 6 months ago
Understanding Promise Theory Using Rewriting Logic
We describe our effort to evaluate the syntax and constraints of Promise Theory using a tool developed in the Maude framework. Through the development of a Maude module we are able...
Kyrre M. Begnum, Mark Burgess
JSC
2011
71views more  JSC 2011»
14 years 6 months ago
Chern numbers of smooth varieties via homotopy continuation and intersection theory
Homotopy continuation provides a numerical tool for computing the equivalence of a smooth variety in an intersection product. Intersection theory provides a theoretical tool for re...
Sandra Di Rocco, David Eklund, Chris Peterson, And...
CORR
2010
Springer
56views Education» more  CORR 2010»
14 years 12 months ago
Theory and Applications of Robust Optimization
In this paper we survey the primary research, both theoretical and applied, in the area of Robust Optimization (RO). Our focus is on the computational attractiveness of RO approac...
Dimitris Bertsimas, David B. Brown, Constantine Ca...
JCC
2002
67views more  JCC 2002»
14 years 11 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