Sciweavers

1425 search results - page 39 / 285
» Beyond Dependency Graphs
Sort
View
IJAMCIGI
2010
94views more  IJAMCIGI 2010»
14 years 4 months ago
A Study of Tabu Search for Coloring Random 3-Colorable Graphs Around the Phase Transition
We present an experimental investigation of tabu search (TS) to solve the 3-coloring problem (3-COL). Computational results reveal that a basic TS algorithm is able to find proper ...
Jean-Philippe Hamiez, Jin-Kao Hao, Fred W. Glover
SCAM
2008
IEEE
15 years 4 months ago
Precise Analysis of Java Programs Using JOANA
The JOANA project (Java Object-sensitive ANAlysis) is a program analysis infrastructure for the Java language. It contains a wide range of analysis techniques such as dependence g...
Dennis Giffhorn, Christian Hammer
VLDB
1993
ACM
121views Database» more  VLDB 1993»
15 years 1 months ago
Integrity Constraint and Rule Maintenance in Temporal Deductive Knowledge Bases
The enforcement of semantic integrity constraints in data and knowledge bases constitutea a major performance bottleneck. Integrity constraint simplification methods aim at reduci...
Dimitris Plexousakis
CISS
2007
IEEE
15 years 1 months ago
Energy Efficient Routing for Statistical Inference of Markov Random Fields
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...
Animashree Anandkumar, Lang Tong, Ananthram Swami
83
Voted
CORR
2010
Springer
166views Education» more  CORR 2010»
14 years 9 months ago
The dynamics of message passing on dense graphs, with applications to compressed sensing
`Approximate message passing' algorithms proved to be extremely effective in reconstructing sparse signals from a small number of incoherent linear measurements. Extensive num...
Mohsen Bayati, Andrea Montanari