2899 search results - page 219 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
175
click to vote
SIAMIS
2008
15 years 6 months ago
2008
We propose, analyze and test an alternating minimization algorithm for recovering images from blurry and noisy observations with total variation (TV) regularization. This algorith...
155
click to vote
ENTCS
2007
15 years 6 months ago
2007
The event B method provides a general framework for modelling both data structures and algorithms. B models are validated by discharging proof obligations ensuring safety properti...
192
click to vote
ADHOC
2008
15 years 6 months ago
2008
This paper shows a novel self-organizing approach for routing datagrams in ad hoc networks, called Distributed Ant Routing (DAR). This approach belongs to the class of routing alg...
201
click to vote
MST
2002
15 years 6 months ago
2002
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...
168
click to vote
SCP
1998
15 years 6 months ago
1998
Consistency techniques are an e cient way of tackling constraint satisfaction problems (CSP). In particular, various arc-consistency algorithms have been designed such as the time...