Sciweavers

5606 search results - page 1075 / 1122
» Randomization Techniques for Graphs.
Sort
View
AAAI
1998
14 years 11 months ago
Fast Probabilistic Modeling for Combinatorial Optimization
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
Shumeet Baluja, Scott Davies
NIPS
2000
14 years 11 months ago
One Microphone Source Separation
Source separation, or computational auditory scene analysis, attempts to extract individual acoustic objects from input which contains a mixture of sounds from different sources, ...
Sam T. Roweis
IOPADS
1997
152views more  IOPADS 1997»
14 years 11 months ago
Competitive Parallel Disk Prefetching and Buffer Management
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
Rakesh D. Barve, Mahesh Kallahalla, Peter J. Varma...
AIPS
2009
14 years 11 months ago
Flexible Execution of Plans with Choice
Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties while improving robustness and reducing the need for an overly conservative plan. Executive...
Patrick R. Conrad, Julie A. Shah, Brian C. William...
ATAL
2010
Springer
14 years 11 months ago
Heuristic search for identical payoff Bayesian games
Bayesian games can be used to model single-shot decision problems in which agents only possess incomplete information about other agents, and hence are important for multiagent co...
Frans A. Oliehoek, Matthijs T. J. Spaan, Jilles St...
« Prev « First page 1075 / 1122 Last » Next »