13841 search results - page 331 / 2769 » Algorithms and Constraint Programming |
212
click to vote
EC
2008
15 years 6 months ago
2008
The development of successful metaheuristic algorithms such as local search for a difficult problems such as satisfiability testing (SAT) is a challenging task. We investigate an ...
198
click to vote
JOTA
2011
14 years 9 months ago
2011
Given an algorithm A for solving some mathematical problem based on the iterative solution of simpler subproblems, an Outer Trust-Region (OTR) modification of A is the result of ...
298
click to vote
POPL
2004
ACM
16 years 7 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
152
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper, we develop an improved approach to the worstcase robust adaptive beamforming for general-rank signal models by means of taking into account the positive semi-defin...
184
click to vote
LOPSTR
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we propose an approach for automated test case generation based on techniques from constraint programming (CP). We advocate the use of standard CP search strategies ...