Sciweavers

IJUFKS
2002
78views more  IJUFKS 2002»
14 years 3 days ago
On the Security of Microaggregation with Individual Ranking: Analytical Attacks
Microaggregation is a statistical disclosure control technique. Raw microdata (i.e. individual records) are grouped into small aggregates prior to publication. With fixed-size grou...
Josep Domingo-Ferrer, Josep Maria Mateo-Sanz, Anna...
TIT
2008
106views more  TIT 2008»
14 years 10 days ago
Constrained Sequential Resource Allocation and Guessing Games
In this paper, we consider a constrained sequential resource allocation problem where an individual needs to accomplish a task by repeatedly guessing/investing a sufficient level o...
Nicholas B. Chang, Mingyan Liu
FUIN
2007
134views more  FUIN 2007»
14 years 11 days ago
Complexity Issues in Multiagent Logics
Abstract. Our previous research presents a methodology of cooperative problem solving for beliefdesire-intention (BDI) systems, based on a complete formal theory called TEAMLOG. Th...
Marcin Dziubinski, Rineke Verbrugge, Barbara Dunin...
IEPOL
2006
53views more  IEPOL 2006»
14 years 13 days ago
Individual and collective determinants of academic scientists' productivity
: The paper analyses the scientific research production of more than a thousand faculty members at Louis Pasteur University, a large and wellranked European research university. Th...
Nicolas Carayol, Mireille Matt
RECSYS
2010
ACM
14 years 19 days ago
Group recommendations with rank aggregation and collaborative filtering
The majority of recommender systems are designed to make recommendations for individual users. However, in some circumstances the items to be selected are not intended for persona...
Linas Baltrunas, Tadas Makcinskas, Francesco Ricci
WSC
2004
14 years 1 months ago
Approaches for Modeling Individuals Within Organizational Simulations
The human behavior modeling community has traditionally been divided into those addressing individual behavior models, and those addressing organizational and team models. And yet...
Eva Hudlicka, Greg L. Zacharias
GECCO
2003
Springer
14 years 5 months ago
A Kernighan-Lin Local Improvement Heuristic That Solves Some Hard Problems in Genetic Algorithms
We present a Kernighan-Lin style local improvement heuristic for genetic algorithms. We analyze the run-time cost of the heuristic. We demonstrate through experiments that the heur...
William A. Greene