4432 search results - page 266 / 887 » Solving Demodulation as an Optimization Problem |
133
click to vote
SDM
2008
SIAM
15 years 5 months ago
2008
SIAM
RELIEF is considered one of the most successful algorithms for assessing the quality of features due to its simplicity and effectiveness. It has been recently proved that RELIEF i...
140
click to vote
AAAI
2004
15 years 5 months ago
2004
We present an efficient approach to adding soft constraints, in the form of preferences, to Disjunctive Temporal Problems (DTPs) and their subclass Temporal Constraint Satisfactio...
139
click to vote
CEC
2003
IEEE
15 years 9 months ago
2003
IEEE
Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...
120
click to vote
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
We consider a regression problem where target values are given as intervals, and propose a statistical approach to it. Although it is hard to solve the optimization problem direct...
148
Voted
AAAI
2008
15 years 6 months ago
2008
This paper investigates the impact of symbolic search for solving domain-independent action planning problems with binary decision diagrams (BDDs). Polynomial upper and exponential...