2233 search results - page 276 / 447 » On the Complexity of Theory Curbing |
194
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
In repeated games with incomplete information, rational agents must carefully weigh the tradeoffs of advantageously exploiting their information to achieve a short-term gain versu...
192
click to vote
OPODIS
2004
15 years 7 months ago
2004
Embedded Systems are components integrating software and hardware jointly and specifically designed to provide given functionalities. These components may be used in many different...
189
click to vote
AAAI
2000
15 years 7 months ago
2000
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
157
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: With the continuously increasing demands on knowledge- and data-management that databases have to meet, ontologies and the theories of granularity they use become more...
156
click to vote
FUIN
2008
15 years 6 months ago
2008
This paper is concerned with the universality problem for timed automata: given a timed automaton A, does A accept all timed words? Alur and Dill have shown that the universality p...