Sciweavers

198 search results - page 21 / 40
» Anytime Bounded Rationality
Sort
View
AAAI
2011
13 years 9 months ago
Pushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models
We study iterative randomized greedy algorithms for generating (elimination) orderings with small induced width and state space size - two parameters known to bound the complexity...
Kalev Kask, Andrew Gelfand, Lars Otten, Rina Decht...
ECAI
2006
Springer
15 years 1 months ago
Coalition Structure Generation in Task-Based Settings
The coalition formation process, in which a number of independent, autonomous agents come together to act as a collective, is an important form of interaction in multi-agent system...
Viet Dung Dang, Nicholas R. Jennings
SAS
2009
Springer
147views Formal Methods» more  SAS 2009»
15 years 10 months ago
Polymorphic Fractional Capabilities
Abstract. The capability calculus is a framework for statically reasoning about program resources such as deallocatable memory regions. Fractional capabilities, originally proposed...
Hirotoshi Yasuoka, Tachio Terauchi
MANSCI
2010
138views more  MANSCI 2010»
14 years 8 months ago
eBay's Crowded Evenings: Competition Neglect in Market Entry Decisions
: Do firms neglect competition when making entry decisions? Using a dataset of 14,973 eBay auctions this paper addresses this question analyzing the time of day at which sellers se...
Uri Simonsohn
ALDT
2009
Springer
158views Algorithms» more  ALDT 2009»
14 years 7 months ago
Axioms for a Class of Algorithms of Sequential Decision Making
Abstract. We axiomatically characterise a class of algorithms for making sequential decisions in situations of complete ignorance. These algorithms assume that a decision maker (DM...
Murali Agastya, Arkadii M. Slinko