Sciweavers

330 search results - page 49 / 66
» Open Problems in Logic and Games
Sort
View
DAC
2007
ACM
14 years 9 months ago
Progressive Decomposition: A Heuristic to Structure Arithmetic Circuits
Despite the impressive progress of logic synthesis in the past decade, finding the best architecture for a given circuit still remains an open problem and largely unsolved. In mos...
Ajay K. Verma, Philip Brisk, Paolo Ienne
ECAI
2010
Springer
13 years 9 months ago
On Semantic Update Operators for Answer-Set Programs
Logic programs under the stable models semantics, or answer-set programs, provide an expressive rule based knowledge representation framework, featuring formal, declarative and wel...
Martin Slota, João Leite
POPL
2004
ACM
14 years 8 months ago
Incremental execution of transformation specifications
We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-t...
Ganesh Sittampalam, Oege de Moor, Ken Friis Larsen
ANSS
2000
IEEE
14 years 12 days ago
An Analytic Method for Predicting Simulation Parallelism
The abilityto predict the performance of a simulationapplicationbefore its implementationis an important factor to the adoption of parallel simulation technology in industry. Idea...
Hong Wang, Yong Meng Teo, Seng Chuan Tay
ESA
2010
Springer
172views Algorithms» more  ESA 2010»
13 years 9 months ago
Algorithmic Meta-theorems for Restrictions of Treewidth
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
Michael Lampis