2693 search results - page 336 / 539 » On Computing Complex Navigation Functions |
191
click to vote
PERCOM
2011
ACM
14 years 10 months ago
2011
ACM
—This paper examines the possible uses of different market mechanisms for resource allocation at different levels of Wireless Sensor Network (WSN) architecture. The goal is to ma...
157
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
177
click to vote
RTSS
1992
IEEE
15 years 10 months ago
1992
IEEE
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...
188
click to vote
CP
2000
Springer
15 years 10 months ago
2000
Springer
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
193
click to vote
DRUMS
1998
Springer
15 years 10 months ago
1998
Springer
Autonomous robots need the ability to move purposefully and without human intervention in real-world environments that have not been speci cally engineered for them. These environm...