370 search results - page 52 / 74 » Bounded modified realizability |
103
click to vote
CORR
2002
Springer
14 years 11 months ago
2002
Springer
We examine a computational geometric problem concerning the structure of polymers. We model a polymer as a polygonal chain in three dimensions. Each edge splits the polymer into t...
JHSN
2002
14 years 11 months ago
2002
A computer network consists of a set of computing nodes interconnected via communication channels. It is commonly assumed that, for each pair of network nodes u and v, there is at...
109
click to vote
WG
2010
Springer
14 years 10 months ago
2010
Springer
Cluster Editing is a classical graph theoretic approach to tackle the problem of data set clustering: it consists of modifying a similarity graph into a disjoint union of cliques,...
115
click to vote
AAIM
2009
Springer
14 years 9 months ago
2009
Springer
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed t...
110
click to vote
ACIIDS
2009
IEEE
14 years 9 months ago
2009
IEEE
In this study, we strive to combine the advantages of fuzzy theory, genetic algorithms (GA), H tracking control schemes, smooth control and adaptive laws to design an adaptive fuzz...