Sciweavers

4488 search results - page 538 / 898
» Focusing Search by Using Problem Solving Experience
Sort
View
JMLR
2010
115views more  JMLR 2010»
15 years 5 months ago
Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
Pradeep Ravikumar, Alekh Agarwal, Martin J. Wainwr...
AAMAS
2007
Springer
15 years 6 months ago
A framework for meta-level control in multi-agent systems
Sophisticated agents operating in open environments must make decisions that efficiently trade off the use of their limited resources between dynamic deliberative actions and dom...
Anita Raja, Victor R. Lesser
SAT
2004
Springer
73views Hardware» more  SAT 2004»
16 years 23 hour ago
A SAT Based Scheduler for Tournament Schedules
We present a scheduler with a web interface for generating fair game schedules of a tournament. The tournament can be either single or double round-robin or something in between. T...
Hantao Zhang, Dapeng Li, Haiou Shen
IJCNN
2006
IEEE
16 years 21 days ago
Model Selection via Bilevel Optimization
— A key step in many statistical learning methods used in machine learning involves solving a convex optimization problem containing one or more hyper-parameters that must be sel...
Kristin P. Bennett, Jing Hu, Xiaoyun Ji, Gautam Ku...
IJCAI
2001
15 years 8 months ago
CABOB: A Fast Optimal Algorithm for Combinatorial Auctions
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
Tuomas Sandholm, Subhash Suri, Andrew Gilpin, Davi...