Sciweavers

394 search results - page 42 / 79
» Logical operations and Kolmogorov complexity
Sort
View
ICCAD
2004
IEEE
121views Hardware» more  ICCAD 2004»
14 years 5 months ago
Factoring and eliminating common subexpressions in polynomial expressions
Polynomial expressions are used to compute a wide variety of mathematical functions commonly found in signal processing and graphics applications, which provide good opportunities...
Anup Hosangadi, Farzan Fallah, Ryan Kastner
FOSSACS
2007
Springer
14 years 2 months ago
PDL with Intersection and Converse Is 2 EXP-Complete
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
Stefan Göller, Markus Lohrey, Carsten Lutz
ITC
2002
IEEE
81views Hardware» more  ITC 2002»
14 years 1 months ago
Design Rewiring Using ATPG
—Logic optimization is the step of the very large scale integration (VLSI) design cycle where the designer performs modifications on a design to satisfy different constraints suc...
Andreas G. Veneris, Magdy S. Abadir, Mandana Amiri
FOSSACS
2000
Springer
14 years 7 days ago
A Program Refinement Framework Supporting Reasoning about Knowledge and Time
Abstract. This paper develops a highly expressive semantic framework for program refinement that supports both temporal reasoning and reasoning about the knowledge of a single agen...
Kai Engelhardt, Ron van der Meyden, Yoram Moses
FUIN
2008
177views more  FUIN 2008»
13 years 8 months ago
A Multi-facet Approach to Dynamic Agent Systems
We are concerned with the problem of defining a complex, hybrid, agent based discrete system in a modular way. The modularity results from looking at the system from a number of di...
Marek A. Bednarczyk, Wieslaw Pawlowski, Luca Berna...