Sciweavers

332 search results - page 39 / 67
» An Aristotelian notion of size
Sort
View
APCSAC
2003
IEEE
15 years 1 months ago
Simultaneous MultiStreaming for Complexity-Effective VLIW Architectures
Very Long Instruction Word (VLIW) architectures exploit instruction level parallelism (ILP) with the help of the compiler to achieve higher instruction throughput with minimal hard...
Pradeep Rao, S. K. Nandy, M. N. V. Satya Kiran
LANMR
2007
14 years 11 months ago
Equivalence for the G3'-stable models semantics
Abstract We study the notion of strong equivalence between two disjunctive logic programs under the G3-stable model semantics, also called the P-stable semantics, and we show how s...
José Luis Carballido, José Arrazola,...
AIPS
2000
14 years 11 months ago
Planning with Reduced Operator Sets
Classical propositional STRIPSplanning is nothing but the searchfor a path in the state-transition graph induced by the operators in the planning problem. Whatmakes the problem ha...
Patrik Haslum, Peter Jonsson
78
Voted
CORR
2007
Springer
82views Education» more  CORR 2007»
14 years 9 months ago
Programs as polygraphs: computability and complexity
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
Guillaume Bonfante, Yves Guiraud
ISTCS
1995
Springer
15 years 1 months ago
Some Improvements to Total Degree Tests
A low-degree test is a collection of simple, local rules for checking the proximity of an arbitrary function to a lowdegree polynomial. Each rule depends on the function’s value...
Katalin Friedl, Madhu Sudan