2137 search results - page 275 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
153
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
This work considers the problem of designing optimal multi-agent trajectories to patrol an environment. As performance criterion for optimal patrolling we consider the worst-case t...
171
click to vote
IR
2010
15 years 4 months ago
2010
Abstract Most ranking algorithms are based on the optimization of some loss functions, such as the pairwise loss. However, these loss functions are often different from the criter...
216
click to vote
BMCBI
2005
15 years 6 months ago
2005
Background: To study complex biochemical reaction networks in living cells researchers more and more rely on databases and computational methods. In order to facilitate computatio...
309
click to vote
GIS
2006
ACM
16 years 7 months ago
2006
ACM
If you were told that some object A was perfectly (or somewhat, or not at all) in some direction (e.g., west, above-right) of some reference object B, where in space would you loo...
142
click to vote
WABI
2007
Springer
16 years 8 days ago
2007
Springer
Graph-theoretic models have come to the forefront as some of the most powerful and practical methods for sequence assembly. Simultaneously, the computational hardness of the underl...