1716 search results - page 288 / 344 » Proving Conditional Termination |
110
Voted
EJC
2007
15 years 22 days ago
2007
Let A and B be hypergraphs with a common vertex set V . In a (p, q, A ∪ B) Bart-Moe game, the players take turns selecting previously unclaimed vertices of V . The game ends whe...
100
Voted
ENTCS
2007
15 years 22 days ago
2007
Automated deduction methods should be specified not procedurally, but declaratively, as inference systems which are proved correct regardless of implementation details. Then, di...
108
Voted
EOR
2007
15 years 22 days ago
2007
A simultaneous perturbation stochastic approximation (SPSA) method has been developed in this paper, using the operators of perturbation with the Lipschitz density function. This ...
106
Voted
MSS
2008
IEEE
15 years 22 days ago
2008
IEEE
Abstract. We study farsighted coalitional stability in the context of TUgames. Chwe (1994, p.318) notes that, in this context, it is difficult to prove nonemptiness of the largest ...
137
Voted
PERVASIVE
2008
Springer
15 years 22 days ago
2008
Springer
In energy constrained wireless sensor networks, energy conservation techniques are to be applied in order to maximize the system lifetime. We tackle the problem of increasing netw...