223 search results - page 25 / 45 » Proving Termination by Bounded Increase |
CPAIOR
2008
Springer
14 years 20 days ago
2008
Springer
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...
PAMI
2006
13 years 10 months ago
2006
Algorithms for discrete energy minimization are of fundamental importance in computer vision. In this paper we focus on the recent technique proposed by Wainwright et al. [33] - t...
ECRTS
2009
IEEE
13 years 8 months ago
2009
IEEE
Abstract--Energy and thermal considerations are increasingly driving system designers to adopt multi-core processors. In this paper, we consider the problem of scheduling periodic ...
NFM
2011
13 years 5 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...
MOBICOM
2009
ACM
14 years 5 months ago
2009
ACM
Cognitive relays form a special cooperation relationship among users in cognitive radio networks, and help increase the transmission rates of both primary users and secondary user...