Sciweavers

2944 search results - page 268 / 589
» Improving Bound Propagation
Sort
View
CSREAESA
2004
15 years 8 months ago
A High Performance, Low Area Overhead Carry Lookahead Adder
Adders are some of the most critical data path circuits requiring considerable design effort in order to "squeeze" out as much performance gain as possible. Many adder d...
James Levy, Jabulani Nyathi
FORTE
2004
15 years 8 months ago
PEPA Nets in Practice: Modelling a Decentralised Peer-to-Peer Emergency Medical Application
Abstract. We apply the PEPA nets modelling language to modelling a peer-topeer medical informatics application, the FieldCare PDA-based medical records system developed by SINTEF T...
Stephen Gilmore, Valentin Haenel, Jane Hillston, L...
AAAI
1998
15 years 8 months ago
Bayesian Q-Learning
A central problem in learning in complex environmentsis balancing exploration of untested actions against exploitation of actions that are known to be good. The benefit of explora...
Richard Dearden, Nir Friedman, Stuart J. Russell
CORR
2006
Springer
104views Education» more  CORR 2006»
15 years 6 months ago
Loop corrections for approximate inference
We propose a method to improve approximate inference methods by correcting for the influence of loops in the graphical model. The method is a generalization and alternative implem...
Joris M. Mooij, Bert Kappen
IJAIT
2008
99views more  IJAIT 2008»
15 years 6 months ago
Optimal Basic Block Instruction Scheduling for Multiple-Issue Processors Using Constraint Programming
Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction sch...
Abid M. Malik, Jim McInnes, Peter van Beek