192 search results - page 33 / 39 » On-Demand Bound Computation for Best-First Constraint Optimi... |
110
click to vote
ISSRE
2003
IEEE
15 years 2 months ago
2003
IEEE
Component based software development is prone to unexpected interaction faults. The goal is to test as many potential interactions as is feasible within time and budget constraint...
106
click to vote
ICIP
2009
IEEE
14 years 7 months ago
2009
IEEE
This article proposes a new algorithm to compute the projection on the set of images whose total variation is bounded by a constant. The projection is computed through a dual form...
CPAIOR
2008
Springer
14 years 11 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
SIAMJO
2010
14 years 8 months ago
2010
Abstract. This paper concerns second-order analysis for a remarkable class of variational systems in finite-dimensional and infinite-dimensional spaces, which is particularly imp...
ICDCSW
2003
IEEE
15 years 2 months ago
2003
IEEE
Nodes in ad hoc networks generally transmit data at regular intervals over long periods of time. Recently, ad hoc network nodes have been built that run on little power and have v...