817 search results - page 105 / 164 » An Optimal Linear Time Algorithm for Quasi-Monotonic Segment... |
ACMICEC
2007
ACM
13 years 11 months ago
2007
ACM
This paper presents a decentralized task allocation method that can handle allocation of tasks with time and precedence constraints in a multi-agent setting where not all informat...
DCOSS
2010
Springer
13 years 11 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...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
GLOBECOM
2007
IEEE
14 years 1 months ago
2007
IEEE
This paper introduces a new game theoretic formulation for the design and routing of resilient and translucent networks. An integer linear programming (ILP) modeling is also presen...
DAC
1996
ACM
13 years 11 months ago
1996
ACM
In order to optimize interconnect to avoid signal integrity problems, very fast and accurate 3-D capacitance extraction is essential. Fast algorithms, such as the multipole or prec...