2030 search results - page 249 / 406 » Extremal Problems of Information Combining |
142
click to vote
UIST
2006
ACM
15 years 11 months ago
2006
ACM
NP-hard combinatorial optimization problems are common in real life. Due to their intractability, local search algorithms are often used to solve such problems. Since these algori...
126
click to vote
ATAL
2005
Springer
15 years 11 months ago
2005
Springer
Multi-agent problem domains may require distributed algorithms for a variety of reasons: local sensors, limitations of communication, and availability of distributed computational...
163
click to vote
KES
2004
Springer
15 years 10 months ago
2004
Springer
There is now a huge amount of high quality photometric data available in the literature whose analysis is bound to play a fundamental role in studies of the formation and evolution...
152
click to vote
ICDM
2003
IEEE
15 years 10 months ago
2003
IEEE
We extend the problem of association rule mining – a key data mining problem – to systems in which the database is partitioned among a very large number of computers that are ...
144
click to vote
VTS
2003
IEEE
15 years 10 months ago
2003
IEEE
Irreversible computation necessarily results in energy dissipation due to information loss. While small in comparison to the power consumption of today’s VLSI circuits, if curre...