Sciweavers

961 search results - page 85 / 193
» Automatic design synthesis with artificial intelligence tech...
Sort
View
AAAI
2010
15 years 2 months ago
Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection
The AI community has achieved great success in designing high-performance algorithms for hard combinatorial problems, given both considerable domain knowledge and considerable eff...
Lin Xu, Holger Hoos, Kevin Leyton-Brown
AMAI
2002
Springer
15 years 1 months ago
Generalizations of Watched Literals for Backtracking Search
The technique of watching two literals per clause to determine when a clause becomes a unit clause was introduced recently in the Chaff satisfiability program. That program does n...
Allen Van Gelder
TCAD
1998
114views more  TCAD 1998»
15 years 1 months ago
Behavioral optimization using the manipulation of timing constraints
— We introduce a transformation, named rephasing, that manipulates the timing parameters in control-data-flow graphs (CDFG’s) during the high-level synthesis of data-pathinten...
Miodrag Potkonjak, Mani B. Srivastava
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
15 years 7 months ago
Scalable estimation-of-distribution program evolution
I present a new estimation-of-distribution approach to program evolution where distributions are not estimated over the entire space of programs. Rather, a novel representationbui...
Moshe Looks
PLDI
2005
ACM
15 years 7 months ago
Jungloid mining: helping to navigate the API jungle
Reuse of existing code from class libraries and frameworks is often difficult because APIs are complex and the client code required to use the APIs can be hard to write. We obser...
David Mandelin, Lin Xu, Rastislav Bodík, Do...