475 search results - page 91 / 95 » Z3-Connectivity with Independent Number 2 |
CG
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
COCO
2004
Springer
14 years 2 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
CCS
2006
ACM
14 years 2 months ago
2006
ACM
In-network aggregation is an essential primitive for performing queries on sensor network data. However, most aggregation algorithms assume that all intermediate nodes are trusted...
DAWAK
2006
Springer
14 years 2 months ago
2006
Springer
More and more integration systems use ontologies to solve the problem of semantic heterogeneities between autonomous databases. To automate the integration process, a number of the...
ECIR
2007
Springer
14 years 10 days ago
2007
Springer
Query-independent features (also called document priors), such as the number of incoming links to a document, its Page-Rank, or the type of its associated URL, have been successfu...