Sciweavers

205 search results - page 11 / 41
» Independent Additive Heuristics Reduce Search Multiplicative...
Sort
View
WEA
2004
Springer
120views Algorithms» more  WEA 2004»
14 years 26 days ago
An Improved Time-Sensitive Metaheuristic Framework for Combinatorial Optimization
We introduce a metaheuristic framework for combinatorial optimization. Our framework is similar to others (e.g. [1]) in that it is modular enough that important components can be i...
Vinhthuy T. Phan, Steven Skiena
STOC
2012
ACM
225views Algorithms» more  STOC 2012»
11 years 10 months ago
An algorithmic characterization of multi-dimensional mechanisms
We obtain a characterization of feasible, Bayesian, multi-item multi-bidder mechanisms with independent, additive bidders as distributions over hierarchical mechanisms. Combined w...
Yang Cai, Constantinos Daskalakis, S. Matthew Wein...
ANOR
2004
79views more  ANOR 2004»
13 years 7 months ago
Preference-Based Search and Multi-Criteria Optimization
Many real-world AI problems (e.g. in configuration) are weakly constrained, thus requiring a mechanism for characterizing and finding the preferred solutions. Preferencebased sear...
Ulrich Junker
AAAI
2007
13 years 9 months ago
Filtering, Decomposition and Search Space Reduction for Optimal Sequential Planning
We present in this paper a hybrid planning system which combines constraint satisfaction techniques and planning heuristics to produce optimal sequential plans. It integrates its ...
Stéphane Grandcolas, C. Pain-Barre
ICDCSW
2006
IEEE
14 years 1 months ago
Improve Searching by Reinforcement Learning in Unstructured P2Ps
— Existing searching schemes in unstructured P2Ps can be categorized as either blind or informed. The quality of query results in blind schemes is low. Informed schemes use simpl...
Xiuqi Li, Jie Wu