Sciweavers

130 search results - page 6 / 26
» A New Change of Variables for Efficient BRDF Representation
Sort
View
AIPS
2000
13 years 9 months ago
New Results about LCGP, a Least Committed GraphPlan
Planners from the family of Graphplan (Graphplan, IPP, STAN...) are presently considered as the most efficient ones on numerous planning domains. Their partially ordered plans can...
Michel Cayrol, Pierre Régnier, Vincent Vida...
IIE
2007
116views more  IIE 2007»
13 years 7 months ago
Turtle's Navigation and Manipulation of Geometrical Figures Constructed by Variable Processes in a 3d Simulated Space
Abstract. Issues related to 3d turtle’s navigation and geometrical figures’ manipulation in the simulated 3d space of a newly developed computational environment, MaLT, are re...
Chronis Kynigos, Maria Latsi
CP
2007
Springer
13 years 11 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
AAAI
2010
13 years 9 months ago
Efficient Belief Propagation for Utility Maximization and Repeated Inference
Many problems require repeated inference on probabilistic graphical models, with different values for evidence variables or other changes. Examples of such problems include utilit...
Aniruddh Nath, Pedro Domingos
ITP
2010
114views Mathematics» more  ITP 2010»
13 years 11 months ago
A New Foundation for Nominal Isabelle
Pitts et al introduced a beautiful theory about names and binding based on the notions of permutation and support. The engineering challenge is to smoothly adapt this theory to a t...
Brian Huffman, Christian Urban