497 search results - page 96 / 100 » Approximating max-min linear programs with local algorithms |
104
click to vote
CORR
2004
Springer
14 years 9 months ago
2004
Springer
The rapid e-commerce growth has made both business community and customers face a new situation. Due to intense competition on the one hand and the customer's option to choose...
AI
2010
Springer
14 years 9 months ago
2010
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
64
Voted
BMCBI
2008
14 years 9 months ago
2008
Background: The prediction of conformational B-cell epitopes is one of the most important goals in immunoinformatics. The solution to this problem, even if approximate, would help...
SIAMJO
2002
14 years 9 months ago
2002
We study a class of generalized bundle methods for which the stabilizing term can be any closed convex function satisfying certain properties. This setting covers several algorithm...
79
Voted
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...