Sciweavers

4110 search results - page 280 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
NIPS
2008
15 years 8 months ago
Multi-Agent Filtering with Infinitely Nested Beliefs
In partially observable worlds with many agents, nested beliefs are formed when agents simultaneously reason about the unknown state of the world and the beliefs of the other agen...
Luke S. Zettlemoyer, Brian Milch, Leslie Pack Kael...
ICDE
2010
IEEE
248views Database» more  ICDE 2010»
16 years 6 months ago
FPGA Acceleration for the Frequent Item Problem
Abstract-- Field-programmable gate arrays (FPGAs) can provide performance advantages with a lower resource consumption (e.g., energy) than conventional CPUs. In this paper, we show...
Gustavo Alonso, Jens Teubner, René Mül...
AAAI
1994
15 years 8 months ago
Improving Learning Performance Through Rational Resource Allocation
This article shows how rational analysis can be used to minimize learning cost for a general class of statistical learning problems. We discuss the factors that influence learning...
Jonathan Gratch, Steve A. Chien, Gerald DeJong
CORR
2010
Springer
157views Education» more  CORR 2010»
15 years 6 months ago
Joint Bandwidth and Power Allocation with Admission Control in Wireless Multi-User Networks With and Without Relaying
Equal allocation of bandwidth and/or power may not be efficient for wireless multi-user networks with limited bandwidth and power resources. Joint bandwidth and power allocation s...
Xiaowen Gong, Sergiy A. Vorobyov, Chintha Tellambu...
ENTCS
2008
85views more  ENTCS 2008»
15 years 6 months ago
Comparing CSP and SAT Solvers for Polynomial Constraints in Termination Provers
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
Salvador Lucas, Rafael Navarro-Marset