Sciweavers

6562 search results - page 205 / 1313
» Noetherianity and Combination Problems
Sort
View
FLAIRS
2007
15 years 8 months ago
Random Subsets Support Learning a Mixture of Heuristics
Problem solvers, both human and machine, have at their disposal many heuristics that may support effective search. The efficacy of these heuristics, however, varies with the probl...
Smiljana Petrovic, Susan L. Epstein
SODA
2004
ACM
91views Algorithms» more  SODA 2004»
15 years 7 months ago
Competitive analysis of organization networks or multicast acknowledgement: how much to wait?
We study, from the competitive analysis perspective, the trade off between communication cost and delay cost (or simply the sendor-wait dilemma) on a hierarchy (rooted tree). The p...
Carlos Brito, Elias Koutsoupias, Shailesh Vaya
CEC
2010
IEEE
15 years 6 months ago
Grammatical rules for the automated construction of heuristics
— Developing a problem-domain independent methodology to automatically generate high performing solving strategies for specific problems is one of the challenging trends on hype...
Germán Terrazas, Natalio Krasnogor
TACAS
2010
Springer
255views Algorithms» more  TACAS 2010»
15 years 4 months ago
Satisfiability Modulo the Theory of Costs: Foundations and Applications
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
Alessandro Cimatti, Anders Franzén, Alberto...
ICCAD
2009
IEEE
161views Hardware» more  ICCAD 2009»
15 years 4 months ago
The epsilon-approximation to discrete VT assignment for leakage power minimization
As VLSI technology reaches 45nm technology node, leakage power optimization has become a major design challenge. Threshold voltage (vt) assignment has been extensively studied, du...
Yujia Feng, Shiyan Hu