5473 search results - page 655 / 1095 » On the graph isomorphism problem |
167
click to vote
IPPS
2006
IEEE
16 years 26 days ago
2006
IEEE
This paper presents a Java framework based on separation of concerns and code generation concepts that facilitates development of concurrency and I/O in servers. In this approach,...
142
click to vote
IROS
2006
IEEE
16 years 26 days ago
2006
IEEE
— This paper formalizes and proposes an algorithm to compute coverage diameters of polygons in 2D. Roughly speaking, the coverage diameter of a polygon is the longest possible di...
161
click to vote
ICRA
2005
IEEE
16 years 13 days ago
2005
IEEE
— In this paper we address the problem of generating a motion strategy to find an object in a known 3-D environment as quickly as possible on average. We use a sampling scheme t...
182
click to vote
SPAA
2005
ACM
16 years 12 days ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
172
click to vote
EUROGP
2005
Springer
16 years 11 days ago
2005
Springer
Abstract. Cartesian Genetic Programming is a graph based representation that has many benefits over traditional tree based methods, including bloat free evolution and faster evolu...