A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
On social event organization
2014
Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '14
Preserved Fulltext
We propose efficient heuristic algorithms that improve upon simple greedy algorithms by incorporating the notion of phantom events and by using look-ahead estimation. ...
We propose the Social Event Organization (SEO) problem as one of assigning a set of events for a group of users to attend, where the users are socially connected with each other and have innate levels ...
The problem is NPhard and many of the works resort to approximation algorithms. Superficially, the team formation problem seems similar to ours. ...
doi:10.1145/2623330.2623724
dblp:conf/kdd/LiLBLY14
fatcat:bk3yuqxoezhcrlhy4wkat7arci
A Practical Negotiation-Based Team Formation Model for Non-cooperative Social Networks
2014
2014 IEEE 26th International Conference on Tools with Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we introduce a decentralized negotiation-based team formation model for noncooperative SNs, where social individuals are self-interested. ...
Moreover, compared to other conventional distributed models, our model can reduce team formation time significantly, making our model a better choice for the real-world time-sensitive applications. ...
PROBLEM DESCRIPTION In this section, we provide notations necessary for understanding the problem of team formation in social networks. Social Networks. ...
doi:10.1109/ictai.2014.59
dblp:conf/ictai/WangJ14
fatcat:e5nlsufhazgndjrymcmpb27asa
A review of metaheuristic scheduling techniques in cloud computing
2015
Egyptian Informatics Journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
One of the important research issues which need to be focused for its efficient performance is scheduling. ...
Scheduling in cloud computing belongs to a category of problems known as NP-hard problem due to large solution space and thus it takes a long time to find an optimal solution. ...
Generation: Generate a league schedule for L-1 weeks (one season) and team formations of each team (L solutions) and let them be their present best formations. 3. ...
doi:10.1016/j.eij.2015.07.001
fatcat:ig7qekziejdztoajtapdhvwdkq
Multiagent-Based Allocation of Complex Tasks in Social Networks
2015
IEEE Transactions on Emerging Topics in Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
INDEX TERMS Complex task allocation, social networks, multiagent, social effectiveness, load balancing. FIGURE 1. A simple complex task allocation example in a social network. ...
Although several approaches have been proposed to tackle this so-called social task allocation problem, they either suffer from being centralized or ignore the objective of maximizing the social effectiveness ...
[10] investigate a more realistic social team formation problem by introducing more generalized constraints, such as i) including a predetermined team leader; ii) the team members should be socially ...
doi:10.1109/tetc.2015.2403200
fatcat:icg7xfamr5fzha7ghsxvrq2xzi
The multiple team formation problem using sociometry
2016
Computers & Operations Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The Team Formation problem (TFP) has become a well-known problem in the OR literature over the last few years. ...
This new problem is named the Multiple Team Formation Problem (MTFP). ...
Shi and Hao [48] 2013 This work formulates the Team Formation problem from the standpoint of multi-criteria decision-making task ranking in social networks. ...
doi:10.1016/j.cor.2016.05.012
fatcat:f6fvza2mzjbv5altkikf453mru
Willingness optimization for social group activity
2013
Proceedings of the VLDB Endowment
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
We first formulate a new problem, named Willingness mAximization for Social grOup (WASO). ...
This paper points out that the solution obtained by a greedy algorithm is likely to be trapped in a local optimal solution. ...
Expert team formation in social networks has attracted extensive research interests. ...
doi:10.14778/2732240.2732244
fatcat:p3o5hhurhbdnrks3p3nilgikse
Coalition Formation: From Software Agents to Robots
2007
Journal of Intelligent and Robotic Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
A problem that has recently attracted the attention of the research community is the autonomous formation of robot teams to perform complex multirobot tasks. ...
The corresponding problem for software agents is also known in the multi-agent community as the coalition formation problem. ...
for the coalition formation problem. ...
doi:10.1007/s10846-007-9150-0
fatcat:6xjq6hdrgjho7cyoo7fq4sd2ri
Multiagent task allocation in social networks
2011
Autonomous Agents and Multi-Agent Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We show that the complexity of this problem remains NP-complete. Moreover, it is not approximable within some factor. In contrast to this, we develop an efficient greedy algorithm for this problem. ...
This paper proposes a new variant of the task allocation problem, where the agents are connected in a social network and tasks arrive at the agents distributed over the network. ...
the original author(s) and source are credited. ...
doi:10.1007/s10458-011-9168-3
fatcat:vaajjquolrgl7pa6eh4wpdoyiy
Kokkos Kernels: Performance Portable Sparse/Dense Linear Algebra and Graph Kernels
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Specifically, we demonstrate the performance of four sparse kernels, three dense batched kernels, two graph kernels and one team level algorithm. ...
We describe Kokkos Kernels, a library of kernels for sparse linear algebra, dense linear algebra and graph kernels. ...
ACKNOWLEDGMENTS We would like to acknowledge the contributions of several "alumni" and friends of the Kokkos Kernels library ...
arXiv:2103.11991v1
fatcat:m7iskgt5kjdjnex7lenqsjj6z4
Optimization in the utility maximization framework for conservation planning: a comparison of solution procedures in a study of multifunctional agriculture
2014
PeerJ
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The utility maximization problem is one form of a covering problem where multiple criteria can represent the expected social benefits of conservation action. ...
We also model land availability for conservation action as a stochastic process and determine the decline in total utility compared to the globally optimal set using both solution algorithms. ...
We quantified the difference in benefits accrued (accumulated utility) between solutions to compare the gains produced by a simple algorithm (greedy heuristic) with the optimal solution in the utility ...
doi:10.7717/peerj.690
pmid:25538868
pmcid:PMC4266854
fatcat:mv3otywn6nbxdkcspcgmn5egtm
Willingness Optimization for Social Group Activity
[article]
2013
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We first formulate a new problem, named Willingness mAximization for Social grOup (WASO). ...
This paper points out that the solution obtained by a greedy algorithm is likely to be trapped in a local optimal solution. ...
Expert team formation in social networks has attracted extensive research interests. ...
arXiv:1305.1502v2
fatcat:swcbaxzufffxreeoe6zb43n42y
Truthful Mechanisms for Matching and Clustering in an Ordinal World
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Our techniques yield universally truthful algorithms for a number of graph problems: a 1.76-approximation algorithm for Max-Weight Matching, 2-approximation algorithm for Max k-matching, a 6-approximation ...
algorithm for Densest k-subgraph, and a 2-approximation algorithm for Max Traveling Salesman as long as the hidden weights constitute a metric. ...
In this work, we study the design of approximation algorithms for popular graph optimization problems including matching, clustering, and team formation with the goal of understanding the combined price ...
arXiv:1610.04069v2
fatcat:fs4z3cutxnacnbrgx6bw7vg2dq
Chapter 8: Robot Cooperation and Swarm Intelligence
[chapter]
2014
Wireless Sensor and Robot Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
From a methodological point of view, Swarm Intelligence is a set of heuristic solutions inspired by animal swarm behaviors and capable to offer empirical solutions to many computationally hard problems ...
In this chapter, we will try to outline the main research directions in Swarm Intelligence implementation within a robot network through the cooperation among the robots. ...
The social psychology, in particular the theory of dynamic social impact, was another source of inspiration for the development of the first PSO algorithm. ...
doi:10.1142/9789814551342_0008
fatcat:ryqozw2ghjaaljh6jemuudduzq
A Design of Ubiquitous Learning Environment with the Support of Pervasive Computing
2013
Applied Mechanics and Materials
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
in an intelligent way for learners. ...
This paper discussed the function, characteristics and component of ubiquitous learning environment, aims to build a campus integrated learning environment and provide adaptive learning contents and service ...
Acknowledgements This project is founded by the project of Taishan scholars and supported by National Natural Science Foundation of China (No. 61472232, No. 61272094).
References ...
doi:10.4028/www.scientific.net/amm.397-400.2483
fatcat:jpoj3cp7avbn5k4hulxfty5zrq
Searching connected API subgraph via text phrases
2012
Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering - FSE '12
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We start with a greedy subgraph search algorithm which returns a connected subgraph containing nodes with high textual similarity to the query phrases. ...
Furthermore, as the greedy subgraph search algorithm relies on online query of shortest path between two graph nodes, we propose a spaceefficient compressed shortest path indexing scheme that can efficiently ...
We start from a greedy subgraph search algorithm which was originally designed for the team formation problem in an expertise network [11] . ...
doi:10.1145/2393596.2393606
dblp:conf/sigsoft/ChanCL12
fatcat:ghpfpik3njez5hcayidjdntjsq
« Previous
Showing results 1 — 15 out of 796 results