Sciweavers

1197 search results - page 195 / 240
» Which Dynamic Constraint Problems Can Be Solved By Ants
Sort
View
AAAI
2010
13 years 9 months ago
Relational Partially Observable MDPs
Relational Markov Decision Processes (MDP) are a useraction for stochastic planning problems since one can develop abstract solutions for them that are independent of domain size ...
Chenggang Wang, Roni Khardon
FS
2006
135views more  FS 2006»
13 years 8 months ago
Asymmetric Information in Fads Models
Fads models were introduced by Shiller (1984) and Summers (1986) as plausible alternatives to the efficient markets/constant expected returns assumptions. Under these models, loga...
Paolo Guasoni
SIGECOM
2005
ACM
122views ECommerce» more  SIGECOM 2005»
14 years 1 months ago
Robust solutions for combinatorial auctions
Bids submitted in auctions are usually treated as enforceable commitments in most bidding and auction theory literature. In reality bidders often withdraw winning bids before the ...
Alan Holland, Barry O'Sullivan
EVOW
2011
Springer
12 years 11 months ago
Local Search for Mixed-Integer Nonlinear Optimization: A Methodology and an Application
Abstract. A methodology is presented for tackling mixed-integer nonlinear optimization problems by local search, in particular large-scale real-life problems. This methodology is i...
Frédéric Gardi, Karim Nouioua
TMM
2010
151views Management» more  TMM 2010»
13 years 2 months ago
SPANC: Optimizing Scheduling Delay for Peer-to-Peer Live Streaming
Abstract--In peer-to-peer (P2P) live streaming using unstructured mesh, packet scheduling is an important factor in overall playback delay. In this paper, we propose a scheduling a...
Tammy Kam-Hung Chan, Shueng-Han Gary Chan, Ali C. ...