Sciweavers

1277 search results - page 215 / 256
» Terminating Decision Algorithms Optimally
Sort
View
ICML
2007
IEEE
16 years 4 months ago
Conditional random fields for multi-agent reinforcement learning
Conditional random fields (CRFs) are graphical models for modeling the probability of labels given the observations. They have traditionally been trained with using a set of obser...
Xinhua Zhang, Douglas Aberdeen, S. V. N. Vishwanat...
ICPADS
2005
IEEE
15 years 9 months ago
Efficient Distributed QoS Routing Protocol for MPLS Networks
- This paper proposes a new distributed QoS routing protocol, called Efficient Distributed QoS Routing (EDQR), for MPLS networks. The path searching algorithm of EDQR considers an ...
Man-Ching Yuen, Weijia Jia, Chi-Chung Cheung
GECCO
2009
Springer
15 years 8 months ago
Search based data sensitivity analysis applied to requirement engineering
Software engineering is plagued by problems associated with unreliable cost estimates. This paper introduces an approach to sensitivity analysis for requirements engineering. It u...
Mark Harman, Jens Krinke, Jian Ren, Shin Yoo
102
Voted
GECCO
2009
Springer
15 years 8 months ago
Novelty of behaviour as a basis for the neuro-evolution of operant reward learning
An agent that deviates from a usual or previous course of action can be said to display novel or varying behaviour. Novelty of behaviour can be seen as the result of real or appar...
Andrea Soltoggio, Ben Jones
137
Voted
DAC
1997
ACM
15 years 7 months ago
Analysis and Evaluation of Address Arithmetic Capabilities in Custom DSP Architectures
—Many application-specific architectures provide indirect addressing modes with auto-increment/decrement arithmetic. Since these architectures generally do not feature an indexe...
Ashok Sudarsanam, Stan Y. Liao, Srinivas Devadas