885 search results - page 41 / 177 » Optimal Polygon Placement |
ICCAD
2004
IEEE
14 years 6 months ago
2004
IEEE
The main goal of this paper is to develop deeper insights into viable placement-level optimization of routing. Two primary contributions are made. First, an experimental framework...
USENIX
2000
13 years 11 months ago
2000
Optimally partitioning application and filesystem functionality within a cluster of clients and servers is a difficult problem due to dynamic variations in application behavior, r...
SAC
2010
ACM
14 years 4 months ago
2010
ACM
Analysis of systems containing both discrete and continuous dynamics, hybrid systems, is a difficult issue. Most problems have been shown to be undecidable in general, and decidab...
IJCM
2002
13 years 9 months ago
2002
In Layered Manufacturing (LM), a prototype of a virtual polyhedral object is built by slicing the object into polygonal layers, and then building the layers one after another. In ...
IPL
2008
13 years 10 months ago
2008
We consider a server location problem with only one server to move. In this paper we assume that a request is given as a region and that the service can be done anywhere inside th...