Sciweavers

1346 search results - page 21 / 270
» Algorithmic Search for Flexibility Using Resultants of Polyn...
Sort
View
TKDE
2011
330views more  TKDE 2011»
13 years 2 months ago
Effective Navigation of Query Results Based on Concept Hierarchies
— Search queries on biomedical databases, such as PubMed, often return a large number of results, only a small subset of which is relevant to the user. Ranking and categorization...
Abhijith Kashyap, Vagelis Hristidis, Michalis Petr...
GECCO
2003
Springer
182views Optimization» more  GECCO 2003»
14 years 24 days ago
Modeling the Search Landscape of Metaheuristic Software Clustering Algorithms
Abstract. Software clustering techniques are useful for extracting architectural information about a system directly from its source code structure. This paper starts by examining ...
Brian S. Mitchell, Spiros Mancoridis
DISOPT
2007
81views more  DISOPT 2007»
13 years 7 months ago
Strong polynomiality of resource constraint propagation
Constraint-based schedulers have been widely successful to tackle complex, disjunctive and cumulative, scheduling applications by combining tree search and constraint propagation....
Luc Mercier, Pascal Van Hentenryck
ICML
2009
IEEE
14 years 8 months ago
Near-Bayesian exploration in polynomial time
We consider the exploration/exploitation problem in reinforcement learning (RL). The Bayesian approach to model-based RL offers an elegant solution to this problem, by considering...
J. Zico Kolter, Andrew Y. Ng
HASE
2007
IEEE
13 years 11 months ago
An Efficient Experimental Methodology for Configuring Search-Based Design Algorithms
Many problems in high assurance systems design are only tractable using computationally expensive search algorithms. For these algorithms to be useful, designers must be provided ...
Simon M. Poulding, Paul Emberson, Iain Bate, John ...