418 search results - page 9 / 84 » A relaxation-based algorithm for solving the conditional p-c... |
ICASSP
2010
IEEE
13 years 8 months ago
2010
IEEE
This paper considers two problems in sparse filter design, the first involving a least-squares constraint on the frequency response, and the second a constraint on signal-to-noi...
TSMC
2010
13 years 3 months ago
2010
The memory dumping problem arises in the context of planning and scheduling activities of the Mars Express mission of the European Space Agency. The problem consists of scheduling...
STDBM
2004
Springer
14 years 2 months ago
2004
Springer
Application systems often need to react with certain actions whenever some preset conditions are satisfied. In many cases, the evaluation of these conditions takes long time, but...
AMAI
2004
Springer
14 years 2 months ago
2004
Springer
Recent dynamic local search (DLS) algorithms such as SAPS are amongst the state-of-the-art methods for solving the propositional satisfiability problem (SAT). DLS algorithms modi...
TEC
2008
13 years 8 months ago
2008
In this paper, we propose a technique based on genetic programming (GP) for meshfree solution of elliptic partial differential equations. We employ the least-squares collocation pr...