Sciweavers

159 search results - page 11 / 32
» Computational Complexity of Fundamental Problems in Social C...
Sort
View
WISEC
2009
ACM
15 years 6 months ago
Towards a theory for securing time synchronization in wireless sensor networks
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
Murtuza Jadliwala, Qi Duan, Shambhu J. Upadhyaya, ...
GECCO
2007
Springer
190views Optimization» more  GECCO 2007»
15 years 6 months ago
Analysis of evolutionary algorithms for the longest common subsequence problem
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
Thomas Jansen, Dennis Weyland
KDD
2003
ACM
269views Data Mining» more  KDD 2003»
16 years 5 days ago
Maximizing the spread of influence through a social network
Models for the processes by which ideas and influence propagate through a social network have been studied in a number of domains, including the diffusion of medical and technolog...
David Kempe, Jon M. Kleinberg, Éva Tardos
PDC
2004
ACM
15 years 5 months ago
Social creativity: turning barriers into opportunities for collaborative design
Design is a ubiquitous activity. The complexity of design problems requires communities rather than individuals to address, frame, and solve them. These design communities have to...
Gerhard Fischer
ATAL
2003
Springer
15 years 5 months ago
A decision making procedure for collaborative planning
A team of agents planning to perform a complex task make a number of interrelated decisions as they determine precisely how that complex task will be performed. The decision set i...
Timothy W. Rauenbusch, Barbara J. Grosz