Sciweavers

15485 search results - page 310 / 3097
» Computing Optimal Subsets
Sort
View
FCCM
1998
IEEE
113views VLSI» more  FCCM 1998»
15 years 11 months ago
PAM-Blox: High Performance FPGA Design for Adaptive Computing
PAM-Blox are object-oriented circuit generators on top of the PCI Pamette design environment, PamDC. High- performance FPGA design for adaptive computing is simplified by using a ...
Oskar Mencer, Martin Morf, Michael J. Flynn
GECCO
2006
Springer
133views Optimization» more  GECCO 2006»
15 years 10 months ago
On-line evolutionary computation for reinforcement learning in stochastic domains
In reinforcement learning, an agent interacting with its environment strives to learn a policy that specifies, for each state it may encounter, what action to take. Evolutionary c...
Shimon Whiteson, Peter Stone
ECOOP
2008
Springer
15 years 8 months ago
Computing Stack Maps with Interfaces
Abstract. Lightweight bytecode verification uses stack maps to annotate Java bytecode programs with type information in order to reduce the verification to type checking. This pape...
Frédéric Besson, Thomas P. Jensen, T...
EDBT
2011
ACM
281views Database» more  EDBT 2011»
14 years 10 months ago
Fast and accurate computation of equi-depth histograms over data streams
Equi-depth histograms represent a fundamental synopsis widely used in both database and data stream applications, as they provide the cornerstone of many techniques such as query ...
Hamid Mousavi, Carlo Zaniolo
GECCO
2011
Springer
240views Optimization» more  GECCO 2011»
14 years 10 months ago
Collisions are helpful for computing unique input-output sequences
Computing unique input-output sequences (UIOs) from finite state machines (FSMs) is important for conformance testing in software engineering, where evolutionary algorithms (EAs)...
Chao Qian, Yang Yu, Zhi-Hua Zhou