Výsledky vyhledávání - "NP-hard approximation algorithm"
-
1
Efficient Load-Balanced Clustering Algorithms for wireless sensor networks
ISSN: 0140-3664, 1873-703XVydáno: Elsevier B.V 05.03.2008Vydáno v Computer communications (05.03.2008)“…Wireless sensor networks have been receiving increasing attention in recent years due to their potential applications in the establishment of dynamic…”
Získat plný text
Journal Article -
2
Parallel machine scheduling with nested processing set restrictions
ISSN: 0377-2217, 1872-6860Vydáno: Amsterdam Elsevier B.V 16.07.2010Vydáno v European journal of operational research (16.07.2010)“…We consider the problem of scheduling a set of n independent jobs on m parallel machines, where each job can only be scheduled on a subset of machines called…”
Získat plný text
Journal Article -
3
Efficient Load-Balanced Clustering Algorithms for wireless sensor networks: Algorithmic and Theoretical Aspects of Wireless Ad hoc and Sensor Networks
ISSN: 0140-3664Vydáno: Amsterdam Elsevier Science 2008Vydáno v Computer communications (2008)Získat plný text
Journal Article -
4
Strategy-Proof Pricing for Cloud Service Composition
ISSN: 2168-7161, 2372-0018Vydáno: Piscataway IEEE Computer Society 01.07.2016Vydáno v IEEE Transactions on Cloud Computing (01.07.2016)“…The on-demand provisions of cloud services create a service market, where users can dynamically select services based on such attractive criteria as price and…”
Získat plný text
Journal Article -
5
An Equitable Solution to the Stable Marriage Problem
ISSN: 1082-3409Vydáno: IEEE 01.11.2015Vydáno v 2015 IEEE 27th International Conference on Tools with Artificial Intelligence (ICTAI) (01.11.2015)“…A stable marriage problem (SMP) of size n involves n men and n women, each of whom has ordered members of the opposite gender by descending preferability. A…”
Získat plný text
Konferenční příspěvek Journal Article -
6
Algorithms to determine the threshold reliability of flow networks
ISSN: 0740-817X, 2472-5854, 1545-8830, 2472-5862Vydáno: Norcross Taylor & Francis Group 01.05.2004Vydáno v IIE transactions (01.05.2004)“…The threshold reliability R d of a flow network G can be defined in terms of the flow threshold d as the probability that network G admits a flow of at least d…”
Získat plný text
Journal Article -
7
An Efficient Algorithm for Strategy-Proof Service Composition
Vydáno: IEEE 01.06.2013Vydáno v 2013 IEEE International Conference on Services Computing (01.06.2013)“…One of the most typical models of service market is a reverse auction, where service providers offer their services at a certain price and a user selects a…”
Získat plný text
Konferenční příspěvek -
8
Complex quadratic optimization via semidefinite programming: Models and applications
ISBN: 0542760509, 9780542760501Vydáno: ProQuest Dissertations & Theses 01.01.2005“…Quadratic optimization problems with complex-valued decision variables, in short called complex quadratic optimization problems, find many applications in…”
Získat plný text
Dissertation -
9
Anonymizing Graphs
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 30.10.2008Vydáno v arXiv.org (30.10.2008)“…Motivated by recently discovered privacy attacks on social networks, we study the problem of anonymizing the underlying graph of interactions in a social…”
Získat plný text
Paper

