Sciweavers

656 search results - page 54 / 132
» Graph Theoretical Characterization and Computation of Answer...
Sort
View
JAIR
2012
254views Hardware» more  JAIR 2012»
11 years 10 months ago
Completeness Guarantees for Incomplete Ontology Reasoners: Theory and Practice
To achieve scalability of query answering, the developers of Semantic Web applications are often forced to use incomplete OWL 2 reasoners, which fail to derive all answers for at ...
Bernardo Cuenca Grau, Boris Motik, Giorgos Stoilos...
GECCO
2008
Springer
148views Optimization» more  GECCO 2008»
13 years 8 months ago
Using quotient graphs to model neutrality in evolutionary search
We introduce quotient graphs for modeling neutrality in evolutionary search. We demonstrate that for a variety of evolutionary computing problems, search can be characterized by g...
Dominic Wilson, Devinder Kaur
ICALP
2004
Springer
14 years 1 months ago
Learning a Hidden Subgraph
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
Noga Alon, Vera Asodi
ISAAC
2005
Springer
153views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Network Game with Attacker and Protector Entities
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
Marios Mavronicolas, Vicky G. Papadopoulou, Anna P...
FOCS
2006
IEEE
14 years 1 months ago
Lower Bounds for Additive Spanners, Emulators, and More
An additive spanner of an unweighted undirected graph G with distortion d is a subgraph H such that for any two vertices u, v ∈ G, we have δH(u, v) ≤ δG(u, v) + d. For every...
David P. Woodruff