Sciweavers

225 search results - page 32 / 45
» A Least-Certainty Heuristic for Selective Search
Sort
View
GECCO
2008
Springer
107views Optimization» more  GECCO 2008»
13 years 10 months ago
The influence of scaling and assortativity on takeover times in scale-free topologies
In evolving systems, the topological characteristics of population structure have a pronounced impact on the rate of spread of advantageous alleles, and therefore affect selective...
Joshua L. Payne, Margaret J. Eppstein
AIPS
2009
13 years 10 months ago
Inference and Decomposition in Planning Using Causal Consistent Chains
Current state-of-the-art planners solve problems, easy and hard alike, by search, expanding hundreds or thousands of nodes. Yet, given the ability of people to solve easy problems...
Nir Lipovetzky, Hector Geffner
AI
2002
Springer
13 years 9 months ago
Algorithm for optimal winner determination in combinatorial auctions
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
Tuomas Sandholm
ICDCS
2008
IEEE
14 years 3 months ago
Utility-Based Opportunistic Routing in Multi-Hop Wireless Networks
—Recently, opportunistic routing (OR) has been widely used to compensate for the low packet delivery ratio of multi-hop wireless networks. Previous works either provide heuristic...
Jie Wu, Mingming Lu, Feng Li
IEEEPACT
2007
IEEE
14 years 3 months ago
Automatic Correction of Loop Transformations
Loop nest optimization is a combinatorial problem. Due to the growing complexity of modern architectures, it involves two increasingly difficult tasks: (1) analyzing the profita...
Nicolas Vasilache, Albert Cohen, Louis-Noël P...