728 search results - page 62 / 146 » Efficient Searching with Linear Constraints |
190
click to vote
SIAMIS
2008
15 years 6 months ago
2008
We consider the restoration of piecewise constant images where the number of the regions and their values are not fixed in advance, with a good difference of piecewise constant val...
163
click to vote
IMCSIT
2010
15 years 4 months ago
2010
The portfolio optimization problem is modeled as a mean-risk bicriteria optimization problem where the expected return is maximized and some (scalar) risk measure is minimized. In ...
166
click to vote
AI
2010
Springer
15 years 6 months ago
2010
Springer
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with ...
167
click to vote
DAC
2001
ACM
16 years 7 months ago
2001
ACM
Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to ...
164
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
: A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive ...