326 search results - page 48 / 66 » Complexity Issues in Multiagent Logics |
116
click to vote
IEEEPACT
2002
IEEE
15 years 8 months ago
2002
IEEE
Memory dependence prediction allows out-of-order issue processors to achieve high degrees of instruction level parallelism by issuing load instructions at the earliest time withou...
150
click to vote
ATAL
2009
Springer
15 years 9 months ago
2009
Springer
Weighted voting games are a natural and practically important class of simple coalitional games, in which each agent is assigned a numeric weight, and a coalition is deemed to be ...
156
Voted
WISE
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Approximation has been identified as a potential way of reducing the complexity of logical reasoning. Here we explore approximation for speeding up instance retrieval in...
103
click to vote
FPL
2009
Springer
15 years 7 months ago
2009
Springer
Custom operators, working at custom precisions, are a key ingredient to fully exploit the FPGA flexibility advantage for high-performance computing. Unfortunately, such operators...
152
click to vote
AIIA
1991
Springer
15 years 6 months ago
1991
Springer
The use of approximation as a method for dealing with complex problems is a fundamental research issue in Knowledge Representation. Using approximation in symbolic AI is not strai...