Sciweavers

3281 search results - page 556 / 657
» Bases for parametrized iterativity
Sort
View
AFRIGRAPH
2007
ACM
15 years 5 months ago
Efficient editing of aged object textures
Real objects present an enormous amount of detail, including aging effects. Artists need an intuitive control when they iteratively review and redesign their work to achieve a spe...
Olivier Clément, Jocelyn Benoit, Eric Paque...
ASPDAC
2007
ACM
124views Hardware» more  ASPDAC 2007»
15 years 5 months ago
BddCut: Towards Scalable Symbolic Cut Enumeration
While the covering algorithm has been perfected recently by the iterative approaches, such as DAOmap and IMap, its application has been limited to technology mapping. The main fact...
Andrew C. Ling, Jianwen Zhu, Stephen Dean Brown
CASES
2007
ACM
15 years 5 months ago
An optimistic and conservative register assignment heuristic for chordal graphs
This paper presents a new register assignment heuristic for procedures in SSA Form, whose interference graphs are chordal; the heuristic is called optimistic chordal coloring (OCC...
Philip Brisk, Ajay K. Verma, Paolo Ienne
CAV
2007
Springer
164views Hardware» more  CAV 2007»
15 years 5 months ago
SAT-Based Compositional Verification Using Lazy Learning
Abstract. A recent approach to automated assume-guarantee reasoning (AGR) for concurrent systems relies on computing environment assumptions for components using the L algorithm fo...
Nishant Sinha, Edmund M. Clarke
LION
2010
Springer
190views Optimization» more  LION 2010»
15 years 5 months ago
Algorithm Selection as a Bandit Problem with Unbounded Losses
Abstract. Algorithm selection is typically based on models of algorithm performance learned during a separate offline training sequence, which can be prohibitively expensive. In r...
Matteo Gagliolo, Jürgen Schmidhuber