Sciweavers

1277 search results - page 145 / 256
» Terminating Decision Algorithms Optimally
Sort
View
HT
2009
ACM
15 years 10 months ago
Improving recommender systems with adaptive conversational strategies
Conversational recommender systems (CRSs) assist online users in their information-seeking and decision making tasks by supporting an interactive process. Although these processes...
Tariq Mahmood, Francesco Ricci
124
Voted
ICMLA
2010
15 years 1 months ago
Robust Learning for Adaptive Programs by Leveraging Program Structure
Abstract--We study how to effectively integrate reinforcement learning (RL) and programming languages via adaptation-based programming, where programs can include non-deterministic...
Jervis Pinto, Alan Fern, Tim Bauer, Martin Erwig
128
Voted
CN
2011
111views more  CN 2011»
14 years 7 months ago
On the design of network control and management plane
We provide a design of a control and management plane for data networks using the abstraction of 4D architecture, utilizing and extending 4D’s concept of a logically centralized...
Hammad Iqbal, Taieb Znati
149
Voted
OOPSLA
2005
Springer
15 years 9 months ago
Demand-driven points-to analysis for Java
We present a points-to analysis technique suitable for environments with small time and memory budgets, such as just-in-time (JIT) compilers and interactive development environmen...
Manu Sridharan, Denis Gopan, Lexin Shan, Rastislav...
ISAAC
2009
Springer
113views Algorithms» more  ISAAC 2009»
15 years 8 months ago
On Shortest Disjoint Paths in Planar Graphs
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path fr...
Yusuke Kobayashi, Christian Sommer 0002