1477 search results - page 69 / 296 » Complexity of (iterated) dominance |
184
click to vote
AAAI
2006
15 years 7 months ago
2006
Description Logics (DLs) are the formal foundations of the standard web ontology languages OWL-DL and OWL-Lite. In the Semantic Web and other domains, ontologies are increasingly ...
186
click to vote
CIE
2007
Springer
16 years 11 days ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
147
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
157
click to vote
FOCS
2007
IEEE
16 years 15 days ago
2007
IEEE
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixedparameter tractable. We consider proofs that witness that a given prop...
164
click to vote
ECBS
2006
IEEE
16 years 7 days ago
2006
IEEE
Complex and distributed systems are more and more common. Hardware is going from strength to strength and is embedded in high performance peer-to-peer networks mostly. The task of...