2038 search results - page 105 / 408 » Loops under Strategies |
136
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...
162
click to vote
AUTOMATICA
2006
15 years 3 months ago
2006
All approaches to optimal experiment design for control have so far focused on deriving an input signal (or input signal spectrum) that minimizes some control-oriented measure of ...
154
click to vote
JMLR
2010
15 years 2 months ago
2010
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
175
click to vote
NFM
2011
14 years 10 months ago
2011
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...
137
click to vote
CEC
2007
IEEE
15 years 7 months ago
2007
IEEE
Cooperation enforcement is one of the key issues in ad hoc networks. In this paper we proposes a new strategy driven approach that aims at discouraging selfish behavior among netwo...