Sciweavers

1145 search results - page 150 / 229
» Discrete Green's Functions
Sort
View
CCCG
2008
15 years 7 months ago
Application of computational geometry to network p-center location problems
In this paper we showed that a p( 2)-center location problem in general networks can be transformed to the well known Klee's measure problem [5]. This resulted in an improved...
Qiaosheng Shi, Binay K. Bhattacharya
IFIP12
2008
15 years 7 months ago
Optimizing Relationships Information in Repertory Grids
The Repertory Grid method is widely used in knowledge engineering to infer functional relationships between constructs given by an expert. The method is ignoring information that c...
Enrique Calot, Paola Britos, Ramón Garc&iac...
IJCAI
2007
15 years 7 months ago
The Design of ESSENCE: A Constraint Language for Specifying Combinatorial Problems
ESSENCE is a new formal language for specifying combinatorial problems in a manner similar to natural rigorous specifications that use a mixture of natural language and discrete ...
Alan M. Frisch, Matthew Grum, Christopher Jefferso...
NIPS
2007
15 years 7 months ago
New Outer Bounds on the Marginal Polytope
We give a new class of outer bounds on the marginal polytope, and propose a cutting-plane algorithm for efficiently optimizing over these constraints. When combined with a concav...
David Sontag, Tommi Jaakkola
SODA
2008
ACM
138views Algorithms» more  SODA 2008»
15 years 7 months ago
Fully polynomial time approximation schemes for stochastic dynamic programs
We develop a framework for obtaining Fully Polynomial Time Approximation Schemes (FPTASs) for stochastic univariate dynamic programs with either convex or monotone single-period c...
Nir Halman, Diego Klabjan, Chung-Lun Li, James B. ...