Sciweavers

1511 search results - page 111 / 303
» Randomness, lowness and degrees
Sort
View
AI
2006
Springer
15 years 6 months ago
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
Ole J. Mengshoel, David C. Wilkins, Dan Roth
ENTCS
2006
113views more  ENTCS 2006»
15 years 6 months ago
Concurrent Java Test Generation as a Search Problem
A Random test generator generates executable tests together with their expected results. In the form of a noise-maker, it seeds the program with conditional scheduling primitives ...
Yaniv Eytani
PERCOM
2005
ACM
16 years 5 months ago
Energy Efficient Differentiable Coverage Service Protocols for Wireless Sensor Networks
This paper considers the problem of maintaining the coverage degree of a wireless sensor network at an application specific level while keeping the sensing units of only a subset o...
Hasan Çam, Hidayet Ozgur Sanli
ISQED
2006
IEEE
108views Hardware» more  ISQED 2006»
16 years 10 days ago
SMM: Scalable Analysis of Power Delivery Networks by Stochastic Moment Matching
This paper proposes a novel method for analyzing large onchip power delivery networks via a stochastic moment matching (SMM) method. The proposed method extends the existing direc...
Andrew B. Kahng, Bao Liu, Sheldon X.-D. Tan
COMPSAC
2010
IEEE
15 years 4 months ago
GenRed: A Tool for Generating and Reducing Object-Oriented Test Cases
An important goal of automatic testing techniques, including random testing is to achieve high code coverage with a minimum set of test cases. To meet this goal, random testing res...
Hojun Jaygarl, Kai-Shin Lu, Carl K. Chang