693 search results - page 38 / 139 » Complexity Analysis of Heuristic CSP Search Algorithms |
137
click to vote
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
Encouraging voters to truthfully reveal their preferences in an election has long been an important issue. Previous studies have shown that some voting protocols are hard to manip...
135
click to vote
ICCNMC
2005
Springer
15 years 9 months ago
2005
Springer
This study deals with the topology discovery for the capacitated minimum spanning tree network. The problem is composed of finding the best way to link nodes to a source node and, ...
132
click to vote
KDD
2009
ACM
16 years 4 months ago
2009
ACM
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
145
click to vote
TCAD
2008
15 years 3 months ago
2008
Latency-insensitive protocols allow system-on-chip (SoC) engineers to decouple the design of the computing cores from the design of the intercore communication channels while follo...
127
click to vote
SAGA
2001
Springer
15 years 8 months ago
2001
Springer
We study the combinatorial optimization task of choosing the smoothest map from a given family of maps, which is motivated from motor control unit calibration. The problem is of a ...