Sciweavers

1242 search results - page 58 / 249
» The Theory of Grammar Constraints
Sort
View
GW
2005
Springer
173views Biometrics» more  GW 2005»
15 years 11 months ago
Deixis: How to Determine Demonstrated Objects Using a Pointing Cone
Abstract. We present an collaborative approach towards a detailed understanding of the usage of pointing gestures accompanying referring expressions. This effort is undertaken in t...
Alfred Kranstedt, Andy Lücking, Thies Pfeiffe...
SIGECOM
2011
ACM
229views ECommerce» more  SIGECOM 2011»
14 years 9 months ago
A revealed preference approach to computational complexity in economics
Recent results in complexity theory suggest that various economic theories require agents to solve computationally intractable problems. However, such results assume the agents ar...
Federico Echenique, Daniel Golovin, Adam Wierman
APSEC
2003
IEEE
15 years 9 months ago
Rigorous EBNF-based Definition for a Graphic Modeling Language
Today, the syntax of visual specification languages such as UML is typically defined using meta-modelling techniques. However, this kind of syntax definition has drawbacks. In par...
Yong Xia, Martin Glinz
AIPS
1998
15 years 7 months ago
Encoding HTN Planning in Propositional Logic
Casting planning problems as propositional satis ability problems has recently been shown to be an effective way of scaling up plan synthesis. Until now, the bene ts of this appro...
Amol Dattatraya Mali, Subbarao Kambhampati
DAGSTUHL
2008
15 years 7 months ago
Constraint Satisfaction Problems with Infinite Templates
Allowing templates with infinite domains greatly expands the range of problems that can be formulated as a non-uniform constraint satisfaction problem. It turns out that many CSPs ...
Manuel Bodirsky