2899 search results - page 294 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
172
click to vote
ISAAC
2007
Springer
16 years 24 days ago
2007
Springer
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...
181
click to vote
ASM
2005
ASM
16 years 6 days ago
2005
ASM
Abstract. Exploration algorithms are relevant to the industrial practice of gentest cases from an abstract state machine whose runs define the predicted behavior of the software s...
168
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We consider the problem of testing functions for the property of being a k-junta (i.e., of depending on at most k variables). Fischer, Kindler, Ron, Safra, and Samorodnitsky (J. Co...
184
click to vote
ECRTS
2004
IEEE
15 years 10 months ago
2004
IEEE
This paper presents a new approach to understand the event stream model. Additionally a new approximation algorithm for the feasibility test of the sporadic and the generalized mu...
193
click to vote
NIPS
2008
15 years 8 months ago
2008
In this paper we consider approximate policy-iteration-based reinforcement learning algorithms. In order to implement a flexible function approximation scheme we propose the use o...