188 search results - page 15 / 38 » Abstract Machines, Control, and Sequents |
133
click to vote
COLT
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We establish a generic theoretical tool to construct probabilistic bounds for algorithms where the output is a subset of objects from an initial pool of candidates (or mo...
162
click to vote
VMCAI
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. In this paper we analyze the complexity of checking safety and termination properties, for a very simple, yet non-trivial, class of programs with singly-linked list data ...
129
click to vote
CEC
2005
IEEE
15 years 11 months ago
2005
IEEE
Abstract- Seeding the population of an evolutionary algorithm with solutions from previous runs has proved to be useful when learning control strategies for agents operating in a c...
169
Voted
ASPDAC
1995
ACM
15 years 9 months ago
1995
ACM
Abstract - An approach to top down design for testability using register-transfer level(RTL) partial scan selection is described. We propose a scan selection technique based on tes...
139
click to vote
EWRL
2008
15 years 7 months ago
2008
Abstract. We consider a control problem where the decision maker interacts with a standard Markov decision process with the exception that the reward functions vary arbitrarily ove...