1995 search results - page 149 / 399 » What's the Problem |
157
click to vote
DCOSS
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We consider the problem of estimating the locations of mobile agents by fusing the measurements of displacements of the agents as well as relative position measurements b...
127
click to vote
ESA
2008
Springer
15 years 6 months ago
2008
Springer
We are given a trajectory T and an area A. T might intersect A several times, and our aim is to detect whether T visits A with some regularity, e.g. what is the longest time span t...
143
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...
131
click to vote
ERSA
2006
15 years 5 months ago
2006
In this case study, various ways to partition a code between the microprocessor and FPGA are examined. Discrete image convolution operation with separable kernel is used as the ca...
129
click to vote
IJCAI
1993
15 years 5 months ago
1993
This paper presents an analysis of static and dynamic organizational structures for naturally distributed, homogeneous, cooperative problem solving environments, exemplified by di...