14699 search results - page 279 / 2940 » Complexity and Cognitive Computing |
153
click to vote
FCT
2007
Springer
15 years 6 months ago
2007
Springer
The diameter of an undirected graph is the minimal number d such that there is a path between any two vertices of the graph of length at most d. The radius of a graph is the minim...
122
Voted
AI
2007
Springer
15 years 4 months ago
2007
Springer
Preference aggregation in a multiagent setting is a central issue in both human and computer contexts. In this paper, we study in terms of complexity the vulnerability of preferen...
161
click to vote
IPPS
2010
IEEE
15 years 2 months ago
2010
IEEE
Complex networks capture interactions among entities in various application areas in a graph representation. Analyzing large scale complex networks often answers important question...
141
click to vote
AMC
2007
15 years 4 months ago
2007
: Average case analysis forms an interesting and intriguing part of algorithm theory since it explains why some algorithms with bad worst-case complexity can better themselves in p...
127
click to vote
MFCS
2010
Springer
15 years 2 months ago
2010
Springer
For a finite set Γ of Boolean relations, Max Ones SAT(Γ) and Exact Ones SAT(Γ) are generalized satisfiability problems where every constraint relation is from Γ, and the task...