4781 search results - page 683 / 957 » Complexity at large |
69
Voted
DATE
2010
IEEE
15 years 4 months ago
2010
IEEE
Due to increases in design complexity, routing a reset signal to all registers is becoming more difficult. One way to solve this problem is to reset only certain registers and rely...
93
Voted
AAAI
2007
15 years 3 months ago
2007
This paper deals with the monitoring and diagnosis of large discrete-event systems. The problem is to determine, online, all faults and states that explain the flow of observatio...
97
Voted
AIPS
2010
15 years 3 months ago
2010
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...
93
Voted
AAAI
2007
15 years 3 months ago
2007
AI problems such as autonomous robotic exploration, automatic diagnosis and activity recognition have in common the need for choosing among a set of informative but possibly expen...
75
Voted
AAAI
2008
15 years 3 months ago
2008
Checking CSP consistency is shown, in theory, to be an NP-complete problem. There is two families of methods for CSP consistency checking. The first family holds the complete meth...