10916 search results - page 297 / 2184 » On Constructive Connectives and Systems |
178
click to vote
COMPGEOM
2007
ACM
15 years 10 months ago
2007
ACM
We show how to embed a 3-connected planar graph with n vertices as a 3-polytope with small integer coordinates. The coordinates are bounded by O(27.55n ). The crucial part is the ...
216
click to vote
EUROGP
2008
Springer
15 years 8 months ago
2008
Springer
Two prominent genetic programming approaches are the graph-based Cartesian Genetic Programming (CGP) and Linear Genetic Programming (LGP). Recently, a formal algorithm for construc...
201
click to vote
CCCG
2010
15 years 8 months ago
2010
A dominating set of a graph G = (V, E) is a subset V V of the nodes such that for all nodes v V , either v V or a neighbor u of v is in V . Several routing protocols in ad hoc ...
166
click to vote
SIGSAND
2008
15 years 8 months ago
2008
Abstract: Quality issues and their connection with structural aspects of process models have been recently studied, but there is still a notable lack of research into quality aspec...
203
click to vote
ADHOC
2010
15 years 7 months ago
2010
Abstract-- The efficiency of a communication network depends not only on its control protocols, but also on the underlying network topology. We propose a distributed topology manag...