Sciweavers

3775 search results - page 59 / 755
» The Expression Problem Revisited
Sort
View
113
Voted
AIPS
2003
15 years 2 months ago
Expressive Equivalence of Formalisms for Planning with Sensing
There have been several proposals for expressing planning problems with different forms of uncertainty, including nondeterminism and partial observability. In this paper we invest...
Jussi Rintanen
100
Voted
CP
2010
Springer
14 years 11 months ago
Testing Expressibility Is Hard
We study the expressibility problem: given a finite constraint language Γ on a finite domain and another relation R, can Γ express R? We prove, by an explicit family of example...
Ross Willard
IPL
2000
69views more  IPL 2000»
15 years 17 days ago
Generating all maximal models of a Boolean expression
We examine the computational problem of generating all maximal models of a Boolean expression in CNF. We give a resolution-like method that reduces the unnegated variables of an e...
Dimitris J. Kavvadias, Martha Sideri, Elias C. Sta...
VAMOS
2007
Springer
15 years 6 months ago
On the Structure of Problem Variability: From Feature Diagrams to Problem Frames
Requirements for product families are expressed in terms of commonality and variability. This distinction allows early identification of an appropriate software architecture and ...
Andreas Classen, Patrick Heymans, Robin C. Laney, ...
93
Voted
CVPR
2007
IEEE
16 years 2 months ago
Shape from Planar Curves: A Linear Escape from Flatland
We revisit the problem of recovering 3D shape from the projection of planar curves on a surface. This problem is strongly motivated by perception studies. Applications include sin...
Ady Ecker, Kiriakos N. Kutulakos, Allan D. Jepson