
	Where results make sense

Topic: Minimal convex decomposition

	List of algorithms - Wikipedia, the free encyclopedia
		Gift wrapping algorithm: determining the convex hull of a set of points
		Gilbert-Johnson-Keerthi distance algorithm: determining the smallest distance between two convex shapes.
		Graham scan determining the convex hull of a set of points in the plane
	en.wikipedia.org /wiki/List_of_algorithms (1687 words)

	1994 Abstracts of MCS Reports and Preprints
		To avoid directly minimizing a difficult function, the authors use a special integral transformation to transform the function into a class of gradually deformed, but smoother functions.
		This paper describes a new package for minimizing an unconstrained nonlinear function where the Hessian is large and sparse.
		It is proved that the algorithm converges linearly from the very beginning of the iteration if the related saddle function is strongly convex-concave uniformly and the cross elements between the convex part and the concave part of the variables in its Hessian are bounded on the feasible region.
	www-fp.mcs.anl.gov /division/publications/abstracts/abstracts94.htm (9663 words)

	SEP: Economics and Economic Justice
		The difference is thin in this respect, since the axiomatic analysis in normative economics may be interpreted as performing not only a logical decomposition of a given ranking or principle, but also a clarification of the underlying basic principles or arguments.
		One obtains a theory of "justice as mutual advantage" (Barry 1989, 1995) which is not satisfactory at the bar of any minimal conception of impartiality or equality.
		Interestingly, the Shapley value is not always in the core, except for "convex games", that is, games such that the marginal contribution of a party to a coalition increases when the coalition is bigger.
	plato.stanford.edu /entries/economic-justice (11432 words)

	Publications
		Polynomial-time algorithms for the integer minimal principle for centrosymmetric structures, Acta Crystallographica A, 61(4), 445-452, 2005.
		Shectman, J. and N. Sahinidis, A finite algorithm for global minimization of separable concave programs, Journal of Global Optimization, 12(1), 1-36, 1998.
		Sahinidis, N. and I.E. Grossmann, Transshipment LP model for minimizing the utility cost in a heat exchanger network, in I.E. Grossmann (ed.): CACHE Design Case Study Volume 6: Chemical Engineering Optimization Models with GAMS, CACHE Corporation, Austin, TX (1991).
	archimedes.scs.uiuc.edu /group/publications.html (1642 words)

	Dr. Rina Dechter @ UCI
		van Beek, P., and Dechter, R., "On The Minimality And Global Consistency Of Row-Convex Constraint Networks." Journal of the ACM, Vol.
		Ben-Eliyahu, R., and Dechter, R., "On Computing Minimal Models." In the "Journal of Annals of Mathematics and Artificial Intelligence", 1995.
		Pinkas, G., and Dechter, R., "On Improving Connectionist Energy Minimization." In "Journal of Artificial Intelligence Research" (JAIR), Vol.
	www.ics.uci.edu /~dechter/publications (2962 words)

	Working Papers
		A note on convex cones and constraint qualifications in infinite-dimensional vector spaces
		Rosenfeld, J. Zaks (Eds.): Convexity and Graph Theory.
		Minimal graphs without bilateral symmetry: the case of induced length
	www.or.uni-bonn.de /publications.de.html (13927 words)

	[No title]
		Semantics of Programming Languages.\\ \\ 72-3 \> BUCHBERGER B. 72-3 \> Certain Decompositions of G{\"o}del Numberings and Semantics\\ 72-3 \> Programming Languages \\ 72-3 \> Proc.
		Robot Programming.} } \publ{ \newrep \ypar{87-3 } STIFTER S., ROIDER S. \ypar{87-3 } Collision of Convex Objects in the Plane \kind{In: G. Pernul, A Min Tjoa eds.
		Robot Programming.} } \normal{ \newrep \ypar{87-25 } MCCALLUM S. \ypar{87-25 } Solving Polynomial Strict Inequalities Using Cylindrical Algebraic Decomposition \kind{Technical Report } \spons{VOEST-ALPINE AG Linz } \key{Computer Algebra Algorithms.
	www0.risc.uni-linz.ac.at /library/oldreports.tex (5047 words)

Try your search on: Qwika (all wikis)