Sciweavers

729 search results - page 95 / 146
» A Transitive Closure Based Algorithm for Test Generation
Sort
View
IJCAI
2001
13 years 9 months ago
Balance and Filtering in Structured Satisfiable Problems
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...
Henry A. Kautz, Yongshao Ruan, Dimitris Achlioptas...
CEC
2003
IEEE
14 years 1 months ago
An evolutionary approach for reducing the switching activity in address buses
In this paper we present two new approaches based on genetic algorithms (GA) to reduce power consumption by communication buses in an embedded system. The first approach makes it ...
Giuseppe Ascia, Vincenzo Catania, Maurizio Palesi,...
EUROGRAPHICS
2010
Eurographics
14 years 4 months ago
Synthesis of Responsive Motion Using a Dynamic Model
Synthesizing the movements of a responsive virtual character in the event of unexpected perturbations has proven a difficult challenge. To solve this problem, we devise a fully a...
Yuting Ye and C. Karen Liu
SIGECOM
1999
ACM
202views ECommerce» more  SIGECOM 1999»
14 years 3 days ago
A methodology for workload characterization of E-commerce sites
Performance analysis and capacity planning for e-commerce sites poses an interesting problem: how to best characterize the workload of these sites. Tradition al workload character...
Daniel A. Menascé, Virgilio Almeida, Rodrig...
GECCO
2003
Springer
182views Optimization» more  GECCO 2003»
14 years 1 months ago
Spatial Operators for Evolving Dynamic Bayesian Networks from Spatio-temporal Data
Learning Bayesian networks from data has been studied extensively in the evolutionary algorithm communities [Larranaga96, Wong99]. We have previously explored extending some of the...
Allan Tucker, Xiaohui Liu, David Garway-Heath