2957 search results - page 112 / 592 » The Complexity of Polynomial-Time Approximation |
132
click to vote
IJCAI
2003
15 years 4 months ago
2003
Many real life optimization problems contain both hard and soft constraints, as well as qualitative conditional preferences. However, there is no single formalism to specify all t...
137
click to vote
AAIM
2006
Springer
15 years 9 months ago
2006
Springer
We study the subsequence packing problem: given a string T and a collection of strings {Si}, find disjoint subsequences {Ti} of T with maximum total length such that each Ti is a ...
166
click to vote
ESA
2003
Springer
15 years 8 months ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
120
click to vote
ECCV
2004
Springer
15 years 8 months ago
2004
Springer
Stochastic tracking of structured models in monolithic state spaces often requires modeling complex distributions that are difficult to represent with either parametric or sample...
140
click to vote
OPODIS
2007
15 years 4 months ago
2007
Peer to peer overlay networks have proven to be a good support for storing and retrieving data in a fully decentralized way. A sound approach is to structure them in such a way tha...