Sciweavers

1208 search results - page 211 / 242
» Uniform eventown problems
Sort
View
NAACL
2003
14 years 11 months ago
Evaluating the Evaluation: A Case Study Using the TREC 2002 Question Answering Track
Evaluating competing technologies on a common problem set is a powerful way to improve the state of the art and hasten technology transfer. Yet poorly designed evaluations can was...
Ellen M. Voorhees
AAAI
1996
14 years 11 months ago
Improved Limited Discrepancy Search
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
Richard E. Korf
GECCO
2008
Springer
117views Optimization» more  GECCO 2008»
14 years 10 months ago
CrossNet: a framework for crossover with network-based chromosomal representations
We propose a new class of crossover operators for genetic algorithms (CrossNet) which use a network-based (or graphbased) chromosomal representation. We designed CrossNet with the...
Forrest Stonedahl, William Rand, Uri Wilensky
STOC
2010
ACM
181views Algorithms» more  STOC 2010»
14 years 10 months ago
Load balancing and orientability thresholds for random hypergraphs
Let h > w > 0 be two fixed integers. Let H be a random hypergraph whose hyperedges are uniformly of size h. To w-orient a hyperedge, we assign exactly w of its vertices posi...
Pu Gao, Nicholas C. Wormald
ICASSP
2010
IEEE
14 years 10 months ago
Distributed learning in cognitive radio networks: Multi-armed bandit with distributed multiple players
—We consider a cognitive radio network with distributed multiple secondary users, where each user independently searches for spectrum opportunities in multiple channels without e...
Keqin Liu, Qing Zhao