102291 search results - page 20033 / 20459 » Computability in Computational Geometry |
196
click to vote
IJCAI
1989
15 years 8 months ago
1989
gn problem can be abstractly characterized as a constrained function-to-structure mapping. The de sign task takes as input the specifications of the desired functions of a device...
160
click to vote
IJCAI
1989
15 years 8 months ago
1989
This paper describes a program, called NEWTON, that finds approximate symbolic solutions to parameterized equations in one variable. N E W T O N derives an initial approximation b...
226
click to vote
IJCAI
1989
15 years 8 months ago
1989
entional user behavior, we need a principled mannerAbstract for relaxing contextual constraints when they are violated.When computer speech recognition is used for problem In order...
194
click to vote
MVA
1990
15 years 8 months ago
1990
d at a high abstraction level, and consists in an expectation-driven search starting from symbolic object descriptions and using a version of a distributed blackboard system for re...
204
click to vote
MVA
1990
15 years 8 months ago
1990
This paper proposes a new method for automatic fire detection in cities using image processing techniques. Images are obtained successively at regular intervals from monochrome TV...