920 search results - page 101 / 184 » Generating Satisfiable Problem Instances |
132
Voted
ADC
2008
Springer
15 years 7 months ago
2008
Springer
Existing graph mining algorithms typically assume that the dataset can fit into main memory. As many large graph datasets cannot satisfy this condition, truly scalable graph minin...
ASPDAC
2006
ACM
15 years 6 months ago
2006
ACM
We propose a methodology for optimal k-way partitioning with replication of directed hypergraphs via Boolean satisfiability. We begin by leveraging the power of existing and emerg...
90
Voted
IADIS
2003
15 years 2 months ago
2003
We present an Information Customization framework, which offers a unique hybrid of Adaptive Hypermedia and Constraint Satisfaction methods. IC is being modelled as a constraint sa...
100
click to vote
AUTOMATICA
2008
15 years 25 days ago
2008
The problem of computing bounds on the region-of-attraction for systems with polynomial vector fields is considered. Invariant subsets of the region-of-attraction are characterize...
GLOBECOM
2007
IEEE
15 years 4 months ago
2007
IEEE
Accurate and systematic channel simulation technique is critical for performance verification of digital transceiver design over wireless channels. Despite the abundant results on ...