4926 search results - page 330 / 986 » Two Graph Algorithms On an Associative Computing Model |
117
click to vote
IANDC
2010
15 years 3 months ago
2010
We show that the two NP-complete problems of Dodgson Score and Young Score have differing computational complexities when the winner is close to being a Condorcet winner. On the ...
160
click to vote
JAR
2006
15 years 4 months ago
2006
In many AI fields, the problem of finding out a solution which is as close as possible to a given configuration has to be faced. This paper addresses this problem in a propositiona...
135
click to vote
HICSS
2007
IEEE
15 years 11 months ago
2007
IEEE
In these days, companies need highly flexible processes to deal with changing environments and competitors. Using traditional process models that have to be modeled in all detail...
138
Voted
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—A novel formulation for optimal sensor selection and in-network fusion for distributed inference known as the prizecollecting data fusion (PCDF) is proposed in terms of optimal ...
162
click to vote
APWEB
2006
Springer
15 years 8 months ago
2006
Springer
A Connected Dominating Set (CDS) can serve as a virtual backbone for a wireless sensor network since there is no fixed infrastructure or centralized management in wireless sensor n...