1648 search results - page 140 / 330 » On the generation of bicliques of a graph |
CP
2003
Springer
15 years 7 months ago
2003
Springer
How do we identify inconsistent CSPs quickly? This paper presents relaxation as one possible method; showing how we can generate relaxed CSPs which are easier to prove inconsistent...
98
Voted
CEC
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract— We present a grammar-based genetic programming framework for the solving the timetabling problem via the evolution of constructive heuristics. The grammar used for prod...
ICMCS
2000
IEEE
15 years 6 months ago
2000
IEEE
This paper presents a formal approach based on the RTLOTOS formal description technique for the semantic verification of SMIL documents. The reachability analysis of RT-LOTOS spec...
216
Voted
SIGMOD
2006
ACM
16 years 2 months ago
2006
ACM
This paper introduces the Tuple Graph (TuG) synopses, a new class of data summaries that enable accurate selectivity estimates for complex relational queries. The proposed summari...
117
click to vote
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract—Many sensor network applications are tightly coupled with the geometric environment where the sensor nodes are deployed. The topological skeleton extraction has shown gr...