3082 search results - page 100 / 617 » New Bounds for the Controller Problem |
108
click to vote
COCO
2004
Springer
15 years 9 months ago
2004
Springer
An NP search problem is the problems of finding a witness to the given NP predicate, and TFNP is the class of total NP search problems. TFNP contains a number of subclasses conta...
174
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
168
Voted
PEPM
1995
ACM
15 years 7 months ago
1995
ACM
This paper concerns a method for approximating the possible “shapes” that heap-allocated structures in a program can take on. We present a new approach to finding solutions t...
142
click to vote
CSJM
2006
15 years 4 months ago
2006
Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined -- a synthesis of classical TS...
127
click to vote
IJMC
2006
15 years 4 months ago
2006
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...