7519 search results - page 145 / 1504 » Optimizing Generic Functions |
127
Voted
ENTCS
2007
15 years 5 months ago
2007
The event B method provides a general framework for modelling both data structures and algorithms. B models are validated by discharging proof obligations ensuring safety properti...
151
click to vote
ICML
2010
IEEE
15 years 6 months ago
2010
IEEE
We present the first temporal-difference learning algorithm for off-policy control with unrestricted linear function approximation whose per-time-step complexity is linear in the ...
143
click to vote
MP
1998
15 years 4 months ago
1998
In recent years second-order sufficient conditions of an isolated local minimizer for convex composite optimization problems have been established. In this paper, second-order opt...
136
Voted
EC
2008
15 years 5 months ago
2008
We present a statistical model of empirical optimization that admits the creation of algorithms with explicit and intuitively defined desiderata. Because No Free Lunch theorems di...
149
click to vote
MOBIHOC
2001
ACM
16 years 4 months ago
2001
ACM
The development of practical, localized algorithms is probably the most needed and most challenging task in wireless ad-hoc sensor networks (WASNs). Localized algorithms are a spe...