5606 search results - page 804 / 1122 » Randomization Techniques for Graphs. |
202
click to vote
ASWEC
2005
IEEE
16 years 11 days ago
2005
IEEE
Program slicing is a well-known program analysis technique that extracts the elements of a program related to a particular computation. Based on modular monadic semantics of a pro...
155
click to vote
ICRA
2005
IEEE
16 years 10 days ago
2005
IEEE
Abstract - This paper presents an improvement over a previous contour closure algorithm. Assuming that edge points are given as input, the proposed approach consists of two steps. ...
185
click to vote
BPM
2005
Springer
16 years 8 days ago
2005
Springer
: The capability to easily find useful services becomes increasingly critical in several fields. In this paper we argue that, in many situations, the service discovery process shou...
160
click to vote
GECCO
2005
Springer
16 years 7 days ago
2005
Springer
Embedded Cartesian Genetic Programming (ECGP) is a form of the graph based Cartesian Genetic Programming (CGP) in which modules are automatically acquired and evolved. In this pap...
189
click to vote
ICCS
2005
Springer
16 years 7 days ago
2005
Springer
Abstract. This paper has two foci that are intended to be complementary. First, it describes Conzilla as an incarnation of a concept browser. More specifically, as a technical sol...