1187 search results - page 134 / 238 » Graph-Based Procedural Abstraction |
133
Voted
ASPDAC
2005
ACM
15 years 3 months ago
2005
ACM
The synthesis of clock network in the presence of process variation is becoming a vital design issue towards the performance of digital circuits. In this paper, we propose a clock ...
117
click to vote
ECAI
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. Some constraint problems have a combinatorial structure where the constraints allow the sequence of variables to be rotated (necklaces), if not also the domain values to ...
117
Voted
FOSSACS
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. In this paper, we show how Miquel's Implicit Calculus of Constructions (ICC) can be used as a programming language featuring dependent types. Since this system has a...
141
click to vote
DAGSTUHL
2007
15 years 3 months ago
2007
Abstract. In this paper, we consider two particular problems of directed graph matching. The first problem concerns graphs with nodes that have been subdivided into classes of di...
106
click to vote
FORTE
2008
15 years 3 months ago
2008
Abstract. Model generation is an important formal technique for finding interesting instances of computationally hard problems. In this paper we study model generation over Horn lo...