16504 search results - page 280 / 3301 » New Problems, New Solutions |
151
click to vote
CP
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...
172
click to vote
HICSS
1994
IEEE
15 years 10 months ago
1994
IEEE
We are developing a new problem-solving methodology based on a self-organization paradigm. To realize our future goal of self-organizing computational systems, we have to study co...
168
click to vote
MSV
2004
15 years 8 months ago
2004
A large number of applications can be represented by quantified Boolean formulas (QBF). Although evaluating QBF is NP-hard and thus very difficult, there has been significant progr...
176
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
In this paper an island model is described for the unconstrained Binary Quadratic Problem (BQP), which can be used with up to 2500 binary variables. Our island model uses a master...
161
click to vote
SIAMDM
2008
15 years 6 months ago
2008
A well-known theorem of Nash-Williams and Tutte gives a necessary and sufficient condition for the existence of k edge-disjoint spanning trees in an undirected graph. A corollary o...