83 search results - page 13 / 17 » Warm-Start Strategies in Interior-Point Methods for Linear P... |
117
Voted
AAAI
2007
15 years 5 months ago
2007
We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary...
156
Voted
SIAMJO
2002
15 years 3 months ago
2002
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...
201
Voted
COMCOM
2006
15 years 3 months ago
2006
The pervasiveness and operational autonomy of mesh-based wireless sensor networks (WSNs) make them an ideal candidate in offering sustained monitoring functions at reasonable cost...
131
Voted
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
133
Voted
ICML
2002
IEEE
16 years 4 months ago
2002
IEEE
One of the central challenges in reinforcement learning is to balance the exploration/exploitation tradeoff while scaling up to large problems. Although model-based reinforcement ...