1197 search results - page 233 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
WPES
2003
ACM
14 years 1 months ago
2003
ACM
We give an efficient protocol for sequence comparisons of the edit-distance kind, such that neither party reveals anything about their private sequence to the other party (other t...
CCO
2001
Springer
14 years 14 days ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—Recent deregulation initiatives enable cellular providers to sell excess spectrum for secondary usage. In this paper, we investigate the problem of optimal spot pricing of spect...
CP
2006
Springer
13 years 11 months ago
2006
Springer
In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability problems. However...
WSC
1997
13 years 9 months ago
1997
Simulation modeling can be highly effective for solving problems found in the food, beverage, consumer products, and pharmaceutical industries. The flow of material or fluid in th...