Sciweavers

500 search results - page 30 / 100
» On the Hardness of Being Truthful
Sort
View
LSSC
2007
Springer
15 years 3 months ago
Probabilistic Model of Ant Colony Optimization for Multiple Knapsack Problem
The Ant Colony Optimization (ACO) algorithms are being applied successfully to a wide range of problems. ACO algorithms could be good alternatives to existing algorithms for hard c...
Stefka Fidanova
91
Voted
WMTE
2006
IEEE
15 years 3 months ago
Invisibility Considered Harmful: Revisiting Traditional Principles of Ubiquitous Computing in the Context of Education
Ubiquitous computing, as a subfield of computer science, has traditionally been associated with a set of principles expressed (loosely but tellingly) with terms like transparency,...
Michael Eisenberg, Ann Eisenberg, Leah Buechley, N...
89
Voted
IEEEICCI
2005
IEEE
15 years 3 months ago
Toward the development of cognitive task difficulty metrics to support intelligence analysis research
Intelligence analysis is a cognitively complex task that is the subject of considerable research aimed at developing methods and tools to aid the analysis process. To support such...
Frank L. Greitzer
71
Voted
ASIACRYPT
2004
Springer
15 years 2 months ago
Generic Homomorphic Undeniable Signatures
We introduce a new computational problem related to the interpolation of group homomorphisms which generalizes many famous cryptographic problems including discrete logarithm, Diļ¬...
Jean Monnerat, Serge Vaudenay
ISAAC
2004
Springer
103views Algorithms» more  ISAAC 2004»
15 years 2 months ago
Structural Similarity in Graphs (A Relaxation Approach for Role Assignment)
Standard methods for role assignment partition the vertex set of a graph in such a way that vertices in the same class can be considered to have equivalent roles in the graph. Seve...
Ulrik Brandes, Jürgen Lerner