3433 search results - page 210 / 687 » Heuristics for a bidding problem |
161
click to vote
CRYPTO
2005
Springer
16 years 5 days ago
2005
Springer
In this paper we present a practical heuristic attack on the Ko, Lee et al. key exchange protocol introduced at Crypto 2000 [10]. One of the ideas behind our attack is using Dehorn...
164
click to vote
AAAI
1993
15 years 8 months ago
1993
One of the hardest problems in reasoning about a physical system is finding an approximate model that is mathematically tractable and yet captures the essence of the problem. Appr...
160
click to vote
JCO
2010
15 years 1 months ago
2010
We study a class of scheduling problems with batch setups for the online-list and online-time paradigms. Jobs are to be scheduled in batches for processing. All jobs in a batch st...
138
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
In this paper, we formalize the problem of Basic Graph Pattern (BGP) optimization for SPARQL queries and main memory graph implementations of RDF data. We define and analyze the c...
143
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
In this work, we present two new approaches based on variable neighborhood search (VNS) and ant colony optimization (ACO) for the reconstruction of cross cut shredded text documen...