Sciweavers

417 search results - page 37 / 84
» Some Theory for Generalized Boosting Algorithms
Sort
View
JAIR
2010
115views more  JAIR 2010»
14 years 10 months ago
An Investigation into Mathematical Programming for Finite Horizon Decentralized POMDPs
Decentralized planning in uncertain environments is a complex task generally dealt with by using a decision-theoretic approach, mainly through the framework of Decentralized Parti...
Raghav Aras, Alain Dutech
ICFP
2005
ACM
15 years 11 months ago
Simple, partial type-inference for System F based on type-containment
We explore partial type-inference for System F based on type-containment. We consider both cases of a purely functional semantics and a call-by-value stateful semantics. To enable...
Didier Rémy
DAC
2005
ACM
16 years 23 days ago
Efficient SAT solving: beyond supercubes
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
Domagoj Babic, Jesse D. Bingham, Alan J. Hu
ATAL
2005
Springer
15 years 5 months ago
A simulator for multi-agent partnership formation based on dependence graphs
The PartNET++ system is an experimental multi-agent-based simulation tool that uses a new model based on hyper-graphs for understanding partnership formation among heterogeneous a...
Júlio de Lima do Rêgo Monteiro, Jaime...
STOC
2009
ACM
155views Algorithms» more  STOC 2009»
16 years 12 days ago
A nearly optimal oracle for avoiding failed vertices and edges
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
Aaron Bernstein, David R. Karger