1071 search results - page 88 / 215 » Theories of Automatic Structures and Their Complexity |
SIGACT
2008
13 years 8 months ago
2008
Two long-open problems have been solved: (1) every sufficiently large planar point set in general position contains the vertices of an empty hexagon; (2) every finite collection o...
CACM
1998
13 years 8 months ago
1998
The long range goal of the “Virtual Design Team” (VDT) research program is to develop computational tools to analyze decision making and communication behavior and thereby to ...
ISCAS
1994
IEEE
14 years 9 days ago
1994
IEEE
Earlier research has shown that the problem of optimal weighted median filtering with structural constraints can be formulated as a nonconvex nonlinear programming problem in gene...
CP
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. Most previous theoretical study of the complexity of the constraint satisfaction problem has considered a simplified version of the problem in which all variables have t...
ATAL
2006
Springer
13 years 12 months ago
2006
Springer
Constructing presentations as stories is about presenting events that receive their relevance and meaning within the context of the presentation, and about means to define a well-...