Sciweavers

1088 search results - page 115 / 218
» A Bayesian Approach to Tackling Hard Computational Problems
Sort
View
DCC
2001
IEEE
14 years 10 months ago
Towards Compressing Web Graphs
We consider the problem of compressing graphs of the link structure of the World Wide Web. We provide efficient algorithms for such compression that are motivated by recently prop...
Micah Adler, Michael Mitzenmacher
UAI
2004
14 years 4 days ago
Solving Factored MDPs with Continuous and Discrete Variables
Although many real-world stochastic planning problems are more naturally formulated by hybrid models with both discrete and continuous variables, current state-of-the-art methods ...
Carlos Guestrin, Milos Hauskrecht, Branislav Kveto...
CP
2004
Springer
14 years 4 months ago
The Cardinality Matrix Constraint
Cardinality matrix problems are the underlying structure of several real world problems such as rostering, sports scheduling , and timetabling. These are hard computational problem...
Jean-Charles Régin, Carla P. Gomes
WIMOB
2008
IEEE
14 years 5 months ago
Multi-hop Cross-Layer Design in Wireless Sensor Networks: A Case Study
—Cross-layer design has been proposed as a promising paradigm to tackle various problems of wireless communication systems. Recent research has led to a variety of protocols that...
Philipp Hurni, Torsten Braun, Bharat K. Bhargava, ...
AAAI
2006
14 years 5 days ago
Sample-Efficient Evolutionary Function Approximation for Reinforcement Learning
Reinforcement learning problems are commonly tackled with temporal difference methods, which attempt to estimate the agent's optimal value function. In most real-world proble...
Shimon Whiteson, Peter Stone