371 search results - page 31 / 75 » Partition Theorems and Computability Theory |
WG
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
NJC
2006
14 years 9 months ago
2006
Abstract. General purpose theorem provers provide advanced facilities for proving properties about specifications, and may therefore be a valuable tool in formal program developmen...
LICS
2008
IEEE
15 years 4 months ago
2008
IEEE
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
242
click to vote
ARTCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—Soft Computing is an emerging field that consists of complementary elements of fuzzy logic, neural computing and evolutionary computation. Soft computing techniques have found w...
104
click to vote
EMSOFT
2004
Springer
15 years 3 months ago
2004
Springer
As the bandwidth of CPUs and networks continues to grow, it becomes more attractive, for efficiency reasons, to share such resources among several applications with the minimum le...