1686 search results - page 293 / 338 » Programs as polygraphs: computability and complexity |
94
Voted
ICRA
2002
IEEE
15 years 2 months ago
2002
IEEE
—Creation of cooperative robot teams for complex tasks requires not only agents that can function well individually but also agents that can coordinate their actions. This paper ...
EICS
2009
ACM
15 years 2 months ago
2009
ACM
As user interfaces become more and more complex and feature laden, usability tends to decrease. One possibility to counter this effect are intelligent support mechanisms. In this ...
AGP
1999
IEEE
15 years 2 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
RTSS
1999
IEEE
15 years 2 months ago
1999
IEEE
Previous timing analysis methods have assumed that the worst-case instruction execution time necessarily corresponds to the worst-case behavior. We show that this assumption is wr...
115
click to vote
IEAAIE
1999
Springer
15 years 1 months ago
1999
Springer
This paper describes a new approach to model fuzzy sets using object-oriented programming techniques. Currently, the most frequently used method to model fuzzy sets is by using a p...