4110 search results - page 352 / 822 » Efficient algorithms for the 2-gathering problem |
194
click to vote
TIT
2002
15 years 6 months ago
2002
We consider the problem of binary hypothesis testing using binary decisions from independent and identically distributed (i.i.d). sensors. Identical likelihood-ratio quantizers wit...
170
click to vote
DATE
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper, we propose two FPGA-area allocation algorithms based on profiling results for reducing the impact on performance of dynamic reconfiguration overheads. The problem o...
185
click to vote
VLDB
2000
ACM
15 years 10 months ago
2000
ACM
Maintaining currency of search engine indices by exhaustive crawling is rapidly becoming impossible due to the increasing size and dynamic content of the web. Focused crawlers aim...
159
click to vote
FLAIRS
2008
15 years 9 months ago
2008
Although timetabling has long been studied through constraint satisfaction based techniques, along with many alternatives, only recently work has been reported where distributed t...
177
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
Memory-bounded techniques have shown great promise in solving complex multi-agent planning problems modeled as DEC-POMDPs. Much of the performance gains can be attributed to pruni...