Sciweavers

5316 search results - page 207 / 1064
» Which Search Problems Are Random
Sort
View
INFOCOM
2011
IEEE
14 years 7 months ago
Pricing-based spectrum access control in cognitive radio networks with random access
Abstract—Market-based mechanisms offer promising approaches for spectrum access in cognitive radio networks. In this paper, we focus on two market models, one with a monopoly pri...
Lei Yang, Hongseok Kim, Junshan Zhang, Mung Chiang...
GECCO
2011
Springer
264views Optimization» more  GECCO 2011»
14 years 7 months ago
Critical factors in the performance of novelty search
Novelty search is a recently proposed method for evolutionary computation designed to avoid the problem of deception, in which the fitness function guides the search process away...
Steijn Kistemaker, Shimon Whiteson
ICLP
2010
Springer
15 years 7 months ago
Inductive Logic Programming as Abductive Search
We present a novel approach to non-monotonic ILP and its implementation called tal (Top-directed Abductive Learning). tal overcomes some of the completeness problems of ILP systems...
Domenico Corapi, Alessandra Russo, Emil Lupu
AAAI
2000
15 years 5 months ago
Combining Knowledge and Search to Solve Single-Suit Bridge
In problem solving, it is often important not only to find a solution but also to be able to explain it. We use the game of Bridge to illustrate how tactics, which formalise domai...
Ian Frank, David A. Basin, Alan Bundy
HM
2007
Springer
120views Optimization» more  HM 2007»
15 years 10 months ago
On the Combination of Constraint Programming and Stochastic Search: The Sudoku Case
Sudoku is a notorious logic-based puzzle that is popular with puzzle enthusiasts the world over. From a computational perspective, Sudoku is also a problem that belongs to the set ...
Rhydian Lewis