Sciweavers

1603 search results - page 293 / 321
» Multi-Dimensional Heuristic Searching
Sort
View
112
Voted
ICCAD
2001
IEEE
144views Hardware» more  ICCAD 2001»
15 years 7 months ago
Faster SAT and Smaller BDDs via Common Function Structure
The increasing popularity of SAT and BDD techniques in verification and synthesis encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponent...
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah
96
Voted
WSDM
2009
ACM
191views Data Mining» more  WSDM 2009»
15 years 5 months ago
Generating labels from clicks
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
Rakesh Agrawal, Alan Halverson, Krishnaram Kenthap...
GECCO
2009
Springer
103views Optimization» more  GECCO 2009»
15 years 4 months ago
GAMA (genetic algorithm driven multi-agents)for e-commerce integrative negotiation
Software agents help automate a variety of tasks including those involved in buying and selling products over the internet. The need for handling complex highly configurable produ...
Magda Bahaa Eldin Fayek, Ihab A. Talkhan, Khalil S...
CGO
2008
IEEE
15 years 4 months ago
Cole: compiler optimization level exploration
Modern compilers implement a large number of optimizations which all interact in complex ways, and which all have a different impact on code quality, compilation time, code size,...
Kenneth Hoste, Lieven Eeckhout
GECCO
2007
Springer
300views Optimization» more  GECCO 2007»
15 years 4 months ago
Methodology to select solutions from the pareto-optimal set: a comparative study
The resolution of a Multi-Objective Optimization Problem (MOOP) does not end when the Pareto-optimal set is found. In real problems, a single solution must be selected. Ideally, t...
José C. Ferreira, Carlos M. Fonseca, Ant&oa...