Sciweavers

9359 search results - page 10 / 1872
» Generalization Algorithms for Second-Order Terms
Sort
View
LPNMR
2005
Springer
14 years 2 months ago
An Algebraic Account of Modularity in ID-Logic
ID-logic uses ideas from the field of logic programming to extend second order logic with non-monotone inductive defintions. In this work, we reformulate the semantics of this lo...
Joost Vennekens, Marc Denecker
CIE
2006
Springer
14 years 21 days ago
From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
Johann A. Makowsky
DAC
2007
ACM
14 years 10 months ago
TROY: Track Router with Yield-driven Wire Planning
In this paper, we propose TROY, the first track router with yield-driven wire planning to optimize yield loss due to random defects. As the probability of failure (POF) computed f...
Minsik Cho, Hua Xiang, Ruchir Puri, David Z. Pan
AAAI
1990
13 years 10 months ago
Solving Term Inequalities
This work pertains to the Knuth-Bendix (KB) algorithm which tries to find a complete set of reductions from a given set of equations. In the KB algorithm a term ordering is employ...
Gerald E. Peterson
SIGMETRICS
2010
ACM
206views Hardware» more  SIGMETRICS 2010»
14 years 1 months ago
Successive c-optimal designs: a scalable technique to optimize the measurements on large networks
We propose a new approach to optimize the deployment and the sampling rates of network monitoring tools, such as Netflow, on a large IP network. It reduces to solving a stochasti...
Guillaume Sagnol, Mustapha Bouhtou, Stephane Gaube...