4103 search results - page 206 / 821 » Some results on the Collatz problem |
183
click to vote
AUSAI
2010
Springer
15 years 4 months ago
2010
Springer
We study the problem of clustering uncertain objects whose locations are uncertain and described by probability density functions. We analyze existing pruning algorithms and experi...
182
click to vote
ICARIS
2010
Springer
15 years 4 months ago
2010
Springer
In this research work a large set of the classical numerical functions were taken into account in order to understand both the search capability and the ability to escape from a lo...
215
click to vote
IJWMC
2010
15 years 4 months ago
2010
Coverage, fault tolerance and power consumption constraints make optimal placement of mobile sensors or other mobile agents a hard problem. We have developed a model for describin...
145
click to vote
CIARP
2004
Springer
16 years 3 days ago
2004
Springer
In this paper we describe a heuristic approach to the problem of identifying a pattern embedded within a figure from a predefined set of patterns via the utilization of a genetic a...
194
click to vote
AADEBUG
1997
Springer
15 years 11 months ago
1997
Springer
This paper presents a new approach to enforcing array bounds and pointer checking in the C language. Checking is rigorous in the sense that the result of pointer arithmetic must r...