3875 search results - page 76 / 775 » Approximation algorithms for the 0-extension problem |
ICCSA
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Many problems in computer science are related to scheduling problems or embedding problems. Therefore it is an interesting topic to find efficient (approximation) algori...
100
click to vote
INFOCOM
2012
IEEE
13 years 5 days ago
2012
IEEE
Abstract—BitTorrent has been the most popular P2P (Peer-toPeer) paradigm during recent years. Built upon great intuition, the piece-selection and neighbor-selection modules roote...
WABI
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. The orientation of physical networks is a prime task in deciphering the signaling-regulatory circuitry of the cell. One manifestation of this computational task is as a m...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
109
click to vote
IPCO
2008
14 years 11 months ago
2008
Given a set Q of squares with positive pro ts, the square packing problem is to select and pack a subset of squares of maximum pro t into a rectangular bin R. We present a polynomi...