6274 search results - page 686 / 1255 » Proofs, Programs, Processes |
259
click to vote
AOSD
2012
ACM
14 years 2 months ago
2012
ACM
Emerging languages are often source-to-source compiled to mainstream ones, which offer standardized, fine-tuned implementations of non-functional concerns (NFCs)—including pers...
154
click to vote
CP
2005
Springer
16 years 19 days ago
2005
Springer
This paper presents a technique for learning parameterized implied constraints. They can be added to a model to improve the solving process. Experiments on implied Gcc constraints ...
180
click to vote
ICALP
2005
Springer
16 years 19 days ago
2005
Springer
Abstract. We present a finite ω-complete axiomatization for the process algebra BCCSP modulo failure semantics, in case of a finite alphabet. This solves an open question by Gro...
159
click to vote
IWINAC
2005
Springer
16 years 18 days ago
2005
Springer
The evolutionary algorithms can be considered as a powerful and interesting technique for solving large kinds of control problems. However, the great disadvantage of the evolutiona...
203
click to vote
EH
2003
IEEE
16 years 12 days ago
2003
IEEE
Reuse will become increasingly important as larger digital and analog circuits are created by the techniques of the field of evolvable hardware. This paper discusses the ways by w...