Sciweavers

186 search results - page 29 / 38
» The x-Wait-Freedom Progress Condition
Sort
View
CCIA
2009
Springer
14 years 10 months ago
Anytime Reasoning Mechanism for Conversational Agents
When an agent receives a query from another agent, it tries to satisfy it by building an answer based on its current knowledge. Depending on the available time or the urgency of t...
M. Mariela Morveli-Espinoza, Josep Puyol-Gruart
GECCO
2008
Springer
131views Optimization» more  GECCO 2008»
14 years 10 months ago
Self-adaptive mutation in XCSF
Recent advances in XCS technology have shown that selfadaptive mutation can be highly useful to speed-up the evolutionary progress in XCS. Moreover, recent publications have shown...
Martin V. Butz, Patrick O. Stalph, Pier Luca Lanzi
JCT
2010
113views more  JCT 2010»
14 years 8 months ago
Equations resolving a conjecture of Rado on partition regularity
A linear equation L is called k-regular if every k-coloring of the positive integers contains a monochromatic solution to L. Richard Rado conjectured that for every positive intege...
Boris Alexeev, Jacob Tsimerman
NIPS
2008
14 years 11 months ago
Non-stationary dynamic Bayesian networks
Abstract: Structure learning of dynamic Bayesian networks provide a principled mechanism for identifying conditional dependencies in time-series data. This learning procedure assum...
Joshua W. Robinson, Alexander J. Hartemink
IPPS
1998
IEEE
15 years 2 months ago
Network-Aware Distributed Computing: A Case Study
Abstract. The development of network-aware applications, i.e. applications that dynamically adapt to network conditions, has had some success in the domain of multimedia applicatio...
Hongsuda Tangmunarunkit, Peter Steenkiste