Sciweavers

2398 search results - page 250 / 480
» Constraint Programming and Graph Algorithms
Sort
View
AAECC
1999
Springer
82views Algorithms» more  AAECC 1999»
15 years 6 months ago
Reasoning over Networks by Symbolic Methods
Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In con...
Thomas Sturm
SAC
2008
ACM
15 years 6 months ago
Slack time evaluation with RTSJ
We address in this paper the problem of jointly scheduling hard periodic tasks and soft aperiodic events using the Real-Time Specification for Java (RTSJ). We present the programm...
Damien Masson, Serge Midonnet
CPAIOR
2010
Springer
15 years 4 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
CORR
2007
Springer
124views Education» more  CORR 2007»
15 years 6 months ago
Graph-Based Decoding in the Presence of ISI
We propose a new graph representation for ISI channels that can be used for combined equalization and decoding by linear programming (LP) or iterative message-passing (IMP) decodi...
Mohammad H. Taghavi, Paul H. Siegel
ICDE
2010
IEEE
260views Database» more  ICDE 2010»
16 years 6 months ago
Anonymizing Weighted Social Network Graphs
The increasing popularity of social networks has initiated a fertile research area in information extraction and data mining. Although such analysis can facilitate better understan...
Sudipto Das, Ömer Egecioglu, Amr El Abbadi