Sciweavers

198 search results - page 28 / 40
» Anytime Bounded Rationality
Sort
View
JMLR
2006
117views more  JMLR 2006»
14 years 9 months ago
On the Complexity of Learning Lexicographic Strategies
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
Michael Schmitt, Laura Martignon
JUCS
2010
106views more  JUCS 2010»
14 years 8 months ago
A Heuristic Approach to Positive Root Isolation for Multiple Power Sums
: Given a multiple power sum (extending polynomial’s exponents to real numbers), the positive root isolation problem is to find a list of disjoint intervals, satisfying that the...
Ming Xu, Chuandong Mu, Zhenbing Zeng, Zhi-bin Li
SIAMCO
2011
14 years 4 months ago
Optimal Robust Stabilization and Dissipativity Synthesis by Behavioral Interconnection
Given a nominal plant, together with a fixed neighborhood of this plant, the problem of robust stabilization is to find a controller that stabilizes all plants in that neighborh...
Harry L. Trentelman, Shaik Fiaz, Kiyotsugu Takaba
CCS
2009
ACM
15 years 4 months ago
Mixed-initiative security agents
Security decision-making is hard for both humans and machines. This is because security decisions are context-dependent, require highly dynamic, specialized knowledge, and require...
Rachel Greenstadt, Sadia Afroz, Michael Brennan
FSTTCS
2009
Springer
15 years 4 months ago
Arithmetic Circuits and the Hadamard Product of Polynomials
Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also...
Vikraman Arvind, Pushkar S. Joglekar, Srikanth Sri...