Sciweavers

1536 search results - page 48 / 308
» Approximately Dominating Representatives
Sort
View
WCE
2007
13 years 11 months ago
Local Approximation of Pareto Surface
—In the design process of complex systems, the designer is solving an optimization problem, which involves different disciplines and where all design criteria have to be optimize...
S. V. Utyuzhnikov, Jeremy Maginot, Marin D. Guenov
IPL
2011
91views more  IPL 2011»
13 years 5 months ago
A note on improving the performance of approximation algorithms for radiation therapy
The segment minimization problem consists of representing an integer matrix as the sum of the fewest number of integer matrices each of which have the property that the non-zeroes...
Therese C. Biedl, Stephane Durocher, Holger H. Hoo...
SOFSEM
2009
Springer
14 years 7 months ago
The Shortcut Problem - Complexity and Approximation
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...
Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delli...
CMSB
2009
Springer
14 years 4 months ago
Probabilistic Approximations of Signaling Pathway Dynamics
Systems of ordinary differential equations (ODEs) are often used to model the dynamics of complex biological pathways. We construct a discrete state model as a probabilistic appro...
Bing Liu, P. S. Thiagarajan, David Hsu
ICPR
2008
IEEE
14 years 4 months ago
An approximate algorithm for median graph computation using graph embedding
Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for ins...
Miquel Ferrer, Ernest Valveny, Francesc Serratosa,...