Sciweavers

6142 search results - page 294 / 1229
» The Complexity of Partition Functions
Sort
View
MAGS
2008
121views more  MAGS 2008»
15 years 6 months ago
A decentralized model for automated multi-attribute negotiations with incomplete information and general utility functions
This paper presents a decentralized model that allows self-interested agents to reach "win-win" agreements in a multi-attribute negotiation. The model is based on an alt...
Guoming Lai, Katia P. Sycara, Cuihong Li
JAIR
2000
152views more  JAIR 2000»
15 years 6 months ago
Value-Function Approximations for Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) provide an elegant mathematical framework for modeling complex decision and planning problems in stochastic domains in whic...
Milos Hauskrecht
GECCO
2006
Springer
177views Optimization» more  GECCO 2006»
15 years 10 months ago
Hyper-ellipsoidal conditions in XCS: rotation, linear approximation, and solution structure
The learning classifier system XCS is an iterative rulelearning system that evolves rule structures based on gradient-based prediction and rule quality estimates. Besides classifi...
Martin V. Butz, Pier Luca Lanzi, Stewart W. Wilson
ESA
2003
Springer
116views Algorithms» more  ESA 2003»
15 years 11 months ago
Smoothed Motion Complexity
We propose a new complexity measure for movement of objects, the smoothed motion complexity. Many applications are based on algorithms dealing with moving objects, but usually data...
Valentina Damerow, Friedhelm Meyer auf der Heide, ...
BMCBI
2007
160views more  BMCBI 2007»
15 years 6 months ago
Identifying protein complexes directly from high-throughput TAP data with Markov random fields
Background: Predicting protein complexes from experimental data remains a challenge due to limited resolution and stochastic errors of high-throughput methods. Current algorithms ...
Wasinee Rungsarityotin, Roland Krause, Arno Sch&ou...