1647 search results - page 160 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
179
click to vote
SIAMJO
2002
15 years 4 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 ...
139
Voted
ESANN
2003
15 years 6 months ago
2003
The resource constraint project scheduling problem (RCPSP) is an NP-hard benchmark problem in scheduling which takes into account the limitation of resources’ availabilities in ...
129
click to vote
AI
2005
Springer
15 years 5 months ago
2005
Springer
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...
159
click to vote
SAT
2005
Springer
15 years 10 months ago
2005
Springer
An important extension of satisfiability testing is model-counting, a task that corresponds to problems such as probabilistic reasoning and computing the permanent of a Boolean ma...
171
Voted
AIMSA
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Ontology based data access (OBDA) is concerned with providing access to typically very large data sources through a mediating conceptual layer that allows one to improve ...