3433 search results - page 312 / 687 » Heuristics for a bidding problem |
206
click to vote
CSREASAM
2007
15 years 8 months ago
2007
In this paper, we investigate allocation of data partitions in the network for data objects that are partitioned by using secret sharing schemes [12] or erasure coding schemes [11...
160
click to vote
MASCOTS
2001
15 years 8 months ago
2001
This paper presents a tool for MPLS network dimensioning that allows for multi-hour dimensioning of networks supporting simultaneously peer-to-peer and client-server services. The...
172
click to vote
AAAI
2000
15 years 8 months ago
2000
We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...
171
Voted
AAAI
1997
15 years 8 months ago
1997
The problem of counting the number of solutions to a constraint satisfaction problem (CSP) is rephrased in terms of probability updating in Bayes networks. Approximating the proba...
175
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Hill-climbing has been shown to be more effective than exhaustive search in solving satisfiability problems.Also, it has been used either by itself or in combination with other ...