Sciweavers

1712 search results - page 287 / 343
» A Computational Approach to Binding Theory
Sort
View
CASES
2006
ACM
15 years 5 months ago
Incremental elaboration for run-time reconfigurable hardware designs
We present a new technique for compiling run-time reconfigurable hardware designs. Run-time reconfigurable embedded systems can deliver promising benefits over implementations in ...
Arran Derbyshire, Tobias Becker, Wayne Luk
DEON
2006
Springer
15 years 5 months ago
Strategic Deontic Temporal Logic as a Reduction to ATL, with an Application to Chisholm's Scenario
In this paper we extend earlier work on deontic deadlines in CTL to the framework of alternating time temporal logic (ATL). The resulting setting enables us to model several concep...
Jan Broersen
GECCO
2006
Springer
192views Optimization» more  GECCO 2006»
15 years 5 months ago
Optimising cancer chemotherapy using an estimation of distribution algorithm and genetic algorithms
This paper presents a methodology for using heuristic search methods to optimise cancer chemotherapy. Specifically, two evolutionary algorithms - Population Based Incremental Lear...
Andrei Petrovski, Siddhartha Shakya, John A. W. Mc...
MICCAI
1998
Springer
15 years 5 months ago
The Correlation Ratio as a New Similarity Measure for Multimodal Image Registration
Over the last five years, new "voxel-based" approaches have allowed important progress in multimodal image registration, notably due to the increasing use of information-...
Alexis Roche, Grégoire Malandain, Xavier Pe...
ICML
1994
IEEE
15 years 5 months ago
Learning Without State-Estimation in Partially Observable Markovian Decision Processes
Reinforcement learning (RL) algorithms provide a sound theoretical basis for building learning control architectures for embedded agents. Unfortunately all of the theory and much ...
Satinder P. Singh, Tommi Jaakkola, Michael I. Jord...