Sciweavers

698 search results - page 27 / 140
» Fast functional simulation using branching programs
Sort
View
JMLR
2010
149views more  JMLR 2010»
14 years 8 months ago
Learning Bayesian Network Structure using LP Relaxations
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
Tommi Jaakkola, David Sontag, Amir Globerson, Mari...
ICMCS
2006
IEEE
140views Multimedia» more  ICMCS 2006»
15 years 7 months ago
A Fast Matching Pursuits Algorithm using Sub-Band Decomposition of Video Signals
A high-efficiency video coding method using matching pursuits, which is a waveform coding technique, has recently been proposed. In this method, the motion compensated prediction...
Kousuke Imamura, Yoshimasa Koba, Hideo Hashimoto
WSC
2004
15 years 2 months ago
A New Method to Determine the Tool Count of a Semiconductor Factory Using FabSim
Tool count optimization is mandatory for an efficiently organized semiconductor factory. This paper describes an efficient heuristic to determine the tool count using the compact ...
Holger Vogt
IMSCCS
2006
IEEE
15 years 7 months ago
Verification Environment for a SCMP Architecture
The computer architecture of Single-chip multiprocessor (SCMP) is one of important research topics in developing the next-generation of computer hardware. A verification environme...
Wenbin Yao, Nianmin Yao, Shaobin Cai, Jun Ni
GECCO
2007
Springer
151views Optimization» more  GECCO 2007»
15 years 7 months ago
Solving real-valued optimisation problems using cartesian genetic programming
Classical Evolutionary Programming (CEP) and Fast Evolutionary Programming (FEP) have been applied to realvalued function optimisation. Both of these techniques directly evolve th...
James Alfred Walker, Julian Francis Miller