Sciweavers

5863 search results - page 1107 / 1173
» Calculating Functional Programs
Sort
View
ICCAD
1997
IEEE
112views Hardware» more  ICCAD 1997»
14 years 1 months ago
Circuit optimization via adjoint Lagrangians
The circuit tuning problem is best approached by means of gradient-based nonlinear optimization algorithms. For large circuits, gradient computation can be the bottleneck in the o...
Andrew R. Conn, Ruud A. Haring, Chandramouli Viswe...
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
14 years 20 days ago
On the Communication Complexity of Read-Once AC^0 Formulae
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
T. S. Jayram, Swastik Kopparty, Prasad Raghavendra
FOIKS
2006
Springer
14 years 16 days ago
Reasoning Support for Expressive Ontology Languages Using a Theorem Prover
It is claimed in [45] that first-order theorem provers are not efficient for reasoning with ontologies based on description logics compared to specialised description logic reasone...
Ian Horrocks, Andrei Voronkov
ESAW
2000
Springer
14 years 14 days ago
Models of Coordination
While software is becoming decomposed in more and more finegrained entities, the interactions amongst those become of major importance. While methodologies for building such compon...
Robert Tolksdorf
KBSE
2000
IEEE
14 years 13 days ago
Simultaneous Checking of Completeness and Ground Confluence
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
Adel Bouhoula
« Prev « First page 1107 / 1173 Last » Next »