699 search results - page 57 / 140 » The method of combinatorial telescoping |
154
click to vote
TAINN
2005
Springer
15 years 6 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
EVOW
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We deal with two important problems in pattern recognition that arise in the analysis of large datasets. While most feature subset selection methods use statistical techn...
111
Voted
CEC
2003
IEEE
15 years 5 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 ...
80
Voted
ICCS
2003
Springer
15 years 5 months ago
2003
Springer
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
88
Voted
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
Motivated by combinatorial optimization theory, we propose an algorithmic power allocation method that minimizes the total transmitting power in transmitter diversity systems, prov...