1477 search results - page 168 / 296 » Complexity of (iterated) dominance |
103
Voted
CORR
2000
Springer
15 years 18 days ago
2000
Springer
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
129
Voted
DAM
1999
15 years 14 days ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
137
Voted
TVLSI
2008
15 years 7 days ago
2008
With increasing levels of integration of multiple processing cores and new features to support software functionality, recent generations of microprocessors face difficult validati...
138
Voted
GECCO
2010
Springer
14 years 11 months ago
2010
Springer
Evolutionary multi-objective optimization deals with the task of computing a minimal set of search points according to a given set of objective functions. The task has been made e...
MICS
2010
14 years 11 months ago
2010
The conditional covering problem (CCP) aims to locate facilities on a graph, where the vertex set represents both the demand points and the potential facility locations. The proble...