2159 search results - page 347 / 432 » An Artificial Chemistry for Networking |
222
click to vote
TAINN
2005
Springer
15 years 12 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
212
click to vote
WILF
2005
Springer
15 years 12 months ago
2005
Springer
Computing methods that allow the efficient and accurate processing of experimentally gathered data play a crucial role in biological research. The aim of this paper is to present a...
175
click to vote
FAABS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. This paper summarizes a novel framework, called “physicomimetics,” for the distributed control of large collections of mobile physical agents in sensor networks. The ...
173
click to vote
ECAL
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Path integration is a widely used method of navigation in nature whereby an animal continuously tracks its location by integrating its motion over the course of a journey...
140
click to vote
ISMVL
2010
IEEE
15 years 11 months ago
2010
IEEE
Abstract—Let A and B be integers such that A ≤ B. An nvariable interval function is a mapping IN[n : A, B] : {0, 1}n → {0, 1}, where IN[n : A, B](X) = 1 iff A ≤ X ≤ B. Su...