15485 search results - page 287 / 3097 » Computing Optimal Subsets |
208
click to vote
CCE
2005
15 years 7 months ago
2005
A general method to design optimal redundant sensor network even in the case of one sensor failure and able to estimate process key parameters within a required accuracy is propos...
204
click to vote
TCS
2008
15 years 7 months ago
2008
Formalized study of self-assembly has led to the definition of the tile assembly model, a highly distributed parallel model of computation that may be implemented using molecules ...
202
click to vote
CLIMA
2007
15 years 8 months ago
2007
Abstract. Task-based planning problems for multi-agent systems require multiple agents to find a joint plan for a constrained set of tasks. Typically, each agent receives a subset...
192
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
200
click to vote
ISPD
2006
ACM
16 years 1 months ago
2006
ACM
Linear programming (LP) based methods are attractive for solving the placement problem because of their ability to model Half-Perimeter Wirelength (HPWL) and timing. However, it h...