Sciweavers

1071 search results - page 126 / 215
» An Experimental Study of Benchmarking Functions for Genetic ...
Sort
View
AI
2010
Springer
13 years 9 months ago
Understanding the scalability of Bayesian network inference using clique tree growth curves
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
Ole J. Mengshoel
WWW
2011
ACM
13 years 3 months ago
A word at a time: computing word relatedness using temporal semantic analysis
Computing the degree of semantic relatedness of words is a key functionality of many language applications such as search, clustering, and disambiguation. Previous approaches to c...
Kira Radinsky, Eugene Agichtein, Evgeniy Gabrilovi...
POPL
2012
ACM
12 years 4 months ago
Playing in the grey area of proofs
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
Krystof Hoder, Laura Kovács, Andrei Voronko...
TRIDENTCOM
2010
IEEE
13 years 6 months ago
Towards Maximizing Wireless Testbed Utilization Using Spectrum Slicing
As experimentation becomes one of the de-facto approaches for benchmarking, researchers are turning to testbeds to test, review and verify their work. As a result, several research...
Angelos-Christos Anadiotis, Apostolos Apostolaras,...
VLSID
2003
IEEE
92views VLSI» more  VLSID 2003»
14 years 9 months ago
Energy Efficient Scheduling for Datapath Synthesis
In this paper, we describe two new algorithms for datapath scheduling which aim at energy reduction while maintaining performance. The proposed algorithms, time constrained and re...
Saraju P. Mohanty, N. Ranganathan