1302 search results - page 38 / 261 » On the Strong Chromatic Number |
156
click to vote
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
Termination of recursive functions is an important property in proof assistants based on dependent type theories; it implies consistency and decidability of type checking. Type-bas...
277
click to vote
TIME
2009
IEEE
16 years 1 months ago
2009
IEEE
—Rule-based filters are sequences of rules formed of a condition and a decision. Rules are applied sequentially up to the first fulfilled condition, whose matching decision de...
154
click to vote
PRICAI
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. A successful case of applying brute-force search to functional programming automation is presented and compared with a conventional genetic programming method. From the i...
147
click to vote
IPPS
2003
IEEE
15 years 11 months ago
2003
IEEE
Given a vector ( 1 2 ::: t) of non increasing positive integers, and an undirected graph G = (V E), an L( 1 2 ::: t)-coloring of G is a function f from the vertex set V to a set o...
193
click to vote
CSREASAM
2009
15 years 7 months ago
2009
In this paper we propose a new designated verifier signature scheme based on the threshold signature scheme presented [8] by Ghodosi and Pieprzyk. The advantages of the new scheme ...