2657 search results - page 307 / 532 » On the complexity of hierarchical problem solving |
160
click to vote
ICMCS
2006
IEEE
16 years 25 days ago
2006
IEEE
In this paper an effective method of using SVM classifier for multiple feature classification is proposed. Compared with traditional combination methods where all needed base clas...
175
click to vote
EGH
2005
Springer
16 years 9 days ago
2005
Springer
Complex shaders must be partitioned into multiple passes to execute on GPUs with limited hardware resources. Automatic partitioning gives rise to an NP-hard scheduling problem tha...
178
click to vote
ESAW
2004
Springer
16 years 5 days ago
2004
Springer
The development of multi-agent systems (MAS) implies considering both the social and individual levels of these systems. However, the elements in these levels are not necessarily c...
186
click to vote
FOCS
2003
IEEE
16 years 2 days ago
2003
IEEE
We show that Yao’s XOR Lemma, and its essentially equivalent rephrasing as a Direct Product Lemma, can be re-interpreted as a way of obtaining error-correcting codes with good l...
182
click to vote
WDAG
1999
Springer
15 years 11 months ago
1999
Springer
This short paper establishes lower bounds on the time complexity of algorithms solving the generic broadcast problem. The paper shows that (a) to deliver messages in one round, no...