1399 search results - page 68 / 280 » New Algorithms for k-Center and Extensions |
AI
2011
Springer
13 years 4 months ago
2011
Springer
The Extended Global Cardinality Constraint (EGCC) is a vital component of constraint solving systems, since it is very widely used to model diverse problems. The literature contai...
CORR
2012
Springer
12 years 4 months ago
2012
Springer
The notions of subgraph centrality and communicability, based on the exponential of the adjacency matrix of the underlying graph, have been effectively used in the analysis of und...
TIME
2006
IEEE
14 years 3 months ago
2006
IEEE
In this paper, we consider quantitative temporal or spatial constraint networks whose constraints evolve over time in an ultimately periodic fashion. These constraint networks are...
BNCOD
2007
13 years 10 months ago
2007
: We present a new approach for accelerating the execution of XPath expressions using parameterized materialized XPath views (PXV). While the approach is generic we show how it can...
COLING
1996
13 years 10 months ago
1996
Automatic compilation of the linking relation employed in certain parsing algorithms for context-free languages is examined. Special problems arise in the extension of these algor...